Graphs with Large Generalized (Edge-)Connectivity
The generalized k-connectivity κk(G) of a graph G, introduced by Hager in 1985, is a nice generalization of the classical connectivity. Recently, as a natural counterpart, we proposed the concept of generalized k-edge-connectivity λk(G). In this paper, graphs of order n such that for even k are cha...
Main Authors: | Li Xueliang, Mao Yaping |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2016-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1907 |
Similar Items
-
Packing Trees in Complete Bipartite Graphs
by: Wang Jieyan
Published: (2022-02-01) -
The generalized 3-connectivity of Cartesian product graphs
by: Hengzhe Li, et al.
Published: (2012-03-01) -
Maximum cycle packing using SPR-trees
by: Christin Otto, et al.
Published: (2019-04-01) -
On maximum cycle packings in polyhedral graphs
by: Peter Recht, et al.
Published: (2014-04-01) -
On Directed Edge-Disjoint Spanning Trees in Product Networks, An Algorithmic Approach
by: A.R. Touzene, et al.
Published: (2014-12-01)