Graphs with Large Generalized (Edge-)Connectivity
Xueliang Li ; Yaping Mao
Discussiones Mathematicae Graph Theory, Tome 36 (2016), p. 931-958 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

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 characterized.

Publié le : 2016-01-01
EUDML-ID : urn:eudml:doc:287062 
@article{bwmeta1.element.doi-10_7151_dmgt_1907,
     author = {Xueliang Li and Yaping Mao},
     title = {Graphs with Large Generalized (Edge-)Connectivity},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {36},
     year = {2016},
     pages = {931-958},
     zbl = {1350.05080},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1907}
}

Xueliang Li; Yaping Mao. Graphs with Large Generalized (Edge-)Connectivity. Discussiones Mathematicae Graph Theory, Tome 36 (2016) pp. 931-958. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1907/