Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912597404549120 |
|---|---|
| author | Wang, Yichen Cao, Mengyu Lv, Zequn Lu, Mei |
| author_facet | Wang, Yichen Cao, Mengyu Lv, Zequn Lu, Mei |
| contents | Let $t,q$ and $n$ be positive integers. Write $[q] = \{1,2,\ldots,q\}$. The generalized Hamming graph $H(t,q,n)$ is the graph whose vertex set is the cartesian product of $n$ copies of $[q]$ ($q\ge 2$), where two vertices are adjacent if their Hamming distance is at most $t$. In particular, $H(1,q,n)$ is the well-known Hamming graph and $H(1,2,n)$ is the hypercube. In 2006, Chandran and Kavitha described the asymptotic value of $tw(H(1,q,n))$, where $tw(G)$ denotes the treewidth of $G$. In this paper, we give the exact pathwidth of $H(t,2,n)$ and show that $tw(H(t,q,n)) = Θ(tq^n/\sqrt{n})$ when $n$ goes to infinity. Based on those results, we show that the treewidth of the bipartite Kneser graph $BK(n,k)$ is $\binom{n}{k} - 1$ when $n$ is sufficiently large relative to $k$ and the bounds of $tw(BK(2k+1,k))$ are given. Moreover, we present the bounds of the treewidth of the generalized Petersen graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_12549 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph Wang, Yichen Cao, Mengyu Lv, Zequn Lu, Mei Combinatorics 05C75 Let $t,q$ and $n$ be positive integers. Write $[q] = \{1,2,\ldots,q\}$. The generalized Hamming graph $H(t,q,n)$ is the graph whose vertex set is the cartesian product of $n$ copies of $[q]$ ($q\ge 2$), where two vertices are adjacent if their Hamming distance is at most $t$. In particular, $H(1,q,n)$ is the well-known Hamming graph and $H(1,2,n)$ is the hypercube. In 2006, Chandran and Kavitha described the asymptotic value of $tw(H(1,q,n))$, where $tw(G)$ denotes the treewidth of $G$. In this paper, we give the exact pathwidth of $H(t,2,n)$ and show that $tw(H(t,q,n)) = Θ(tq^n/\sqrt{n})$ when $n$ goes to infinity. Based on those results, we show that the treewidth of the bipartite Kneser graph $BK(n,k)$ is $\binom{n}{k} - 1$ when $n$ is sufficiently large relative to $k$ and the bounds of $tw(BK(2k+1,k))$ are given. Moreover, we present the bounds of the treewidth of the generalized Petersen graph. |
| title | Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph |
| topic | Combinatorics 05C75 |
| url | https://arxiv.org/abs/2403.12549 |