The generalized 4-connectivity of burnt pancake graphs
The generalized k-connectivity of a graph G, denoted by κk(G), is the minimum number of internally 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...
Saved in:
Published in | Discrete Applied Mathematics Vol. 360; pp. 93 - 114 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
15.01.2025
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!