Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.15147 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911992349982720 |
|---|---|
| author | Wang, Jing Huang, Yuanqiu Ouyang, Zhangdong |
| author_facet | Wang, Jing Huang, Yuanqiu Ouyang, Zhangdong |
| contents | The generalized $k$-connectivity of a graph $G$, denoted by $κ_k(G)$, is the minimum number of internally edge disjoint $S$-trees for any $S\subseteq V(G)$ and $|S|=k$. The generalized $k$-connectivity is a natural extension of the classical connectivity and plays a key role in applications related to the modern interconnection networks. The godan graph $EA_n$ is a kind of Cayley graphs which posses many desirable properties. In this paper, we shall study the generalized 4-connectivity of $EA_n$ and show that $κ_4(EA_n)=n-1$ for $n\ge 3$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_15147 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The generalized 4-connectivity of godan graphs Wang, Jing Huang, Yuanqiu Ouyang, Zhangdong Combinatorics The generalized $k$-connectivity of a graph $G$, denoted by $κ_k(G)$, is the minimum number of internally edge disjoint $S$-trees for any $S\subseteq V(G)$ and $|S|=k$. The generalized $k$-connectivity is a natural extension of the classical connectivity and plays a key role in applications related to the modern interconnection networks. The godan graph $EA_n$ is a kind of Cayley graphs which posses many desirable properties. In this paper, we shall study the generalized 4-connectivity of $EA_n$ and show that $κ_4(EA_n)=n-1$ for $n\ge 3$. |
| title | The generalized 4-connectivity of godan graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2405.15147 |