Graphs with Large Generalized (Edge-)Connectivity

Xueliang Li, and Yaping Mao. "Graphs with Large Generalized (Edge-)Connectivity." Discussiones Mathematicae Graph Theory 36.4 (2016): 931-958. <http://eudml.org/doc/287062>.

@article{XueliangLi2016,
abstract = {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.},
author = {Xueliang Li, Yaping Mao},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {(edge-)connectivity; Steiner tree; internally disjoint trees; edge-disjoint trees; packing; generalized (edge-)connectivity; edge connectivity; generalized edge-connectivity},
language = {eng},
number = {4},
pages = {931-958},
title = {Graphs with Large Generalized (Edge-)Connectivity},
url = {http://eudml.org/doc/287062},
volume = {36},
year = {2016},
}

TY - JOUR
AU - Xueliang Li
AU - Yaping Mao
TI - Graphs with Large Generalized (Edge-)Connectivity
JO - Discussiones Mathematicae Graph Theory
PY - 2016
VL - 36
IS - 4
SP - 931
EP - 958
AB - 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.
LA - eng
KW - (edge-)connectivity; Steiner tree; internally disjoint trees; edge-disjoint trees; packing; generalized (edge-)connectivity; edge connectivity; generalized edge-connectivity
UR - http://eudml.org/doc/287062
ER -