paper

The generalized 4-connectivity of godan graphs

arXiv:2405.15147

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 godan graph is a kind of Cayley graphs which posses many desirable properties. In this paper, we shall study the generalized 4-connectivity of and show that for .

The generalized 4-connectivity of godan graphs · wovepaper