The generalized k-connectivity of a graph G, denoted by κₖ(G), is the minimum number of internally edge disjoint S-trees for any S⊆ 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ₙ is a kind of Cayley graphs which posses many desirable properties. In this paper, we shall study the generalized 4-connectivity of EAₙ and show that κ₄(EAₙ)=n-1 for n≥ 3.
No takes yet. Share an insight, caveat, or question.
Wang et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: