The generalized 3-connectivity of burnt pancake graphs and 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 burnt pancake graph BPn and the godan graph EAn are two kinds of Cayley graphs which posses many desirable properties. In this paper, we investigate the generalized 3-connectivity of BPn and EAn. We show that 3(BPn)=n-1 and 3(EAn)=n-1.
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.