The generalized 3-connectivity of burnt pancake graphs and godan graphs
Combinatorics
2022-11-11 v1
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 burnt pancake graph and the godan graph are two kinds of Cayley graphs which posses many desirable properties. In this paper, we investigate the generalized 3-connectivity of and . We show that and .
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