English

The generalized 3-connectivity of burnt pancake graphs and godan graphs

Combinatorics 2022-11-11 v1

Abstract

The generalized kk-connectivity of a graph GG, denoted by κk(G)\kappa_k(G), is the minimum number of internally edge disjoint SS-trees for any SV(G)S\subseteq V(G) and S=k|S|=k. The generalized kk-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 BPnBP_n and the godan graph EAnEA_n are two kinds of Cayley graphs which posses many desirable properties. In this paper, we investigate the generalized 3-connectivity of BPnBP_n and EAnEA_n. We show that κ3(BPn)=n1\kappa_3(BP_n)=n-1 and κ3(EAn)=n1\kappa_3(EA_n)=n-1.

Keywords

Cite

@article{arxiv.2211.05619,
  title  = {The generalized 3-connectivity of burnt pancake graphs and godan graphs},
  author = {Jing Wang and Zuozheng Zhang and Yuanqiu Huang},
  journal= {arXiv preprint arXiv:2211.05619},
  year   = {2022}
}

Comments

arXiv admin note: text overlap with arXiv:2211.00320