The generalized 4-connectivity of godan graphs
Abstract
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⊂eq 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 EAn is a kind of Cayley graphs which posses many desirable properties. In this paper, we shall study the generalized 4-connectivity of EAn and show that 4(EAn)=n-1 for n 3.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.