The generalized 4-connectivity of godan graphs
Jing Wang, Yuanqiu Huang, Zhangdong Ouyang

TL;DR
This paper investigates the generalized 4-connectivity of godan graphs, a type of Cayley graph, establishing that it equals n-1 for all n ≥ 3, which enhances understanding of their network robustness.
Contribution
The paper determines the exact generalized 4-connectivity of godan graphs, extending the theoretical knowledge of their structural properties.
Findings
a_n has a_n-1 generalized 4-connectivity for n 3.
Provides new insights into the connectivity properties of Cayley graphs.
Enhances understanding of network robustness in interconnection networks.
Abstract
The generalized -connectivity of a graph , denoted by , is the minimum number of internally edge disjoint -trees for any and . The generalized -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 is a kind of Cayley graphs which posses many desirable properties. In this paper, we shall study the generalized 4-connectivity of and show that for .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Interconnection Networks and Systems · Advanced Graph Theory Research
