Pendant-tree connectivity of line graphs

2016/04/07 by Yaping Mao, Mao, Yaping · 2 citations
Computer Science · Materials Science · Mathematics · #Advanced Graph Theory Research #Graphene research and applications #Interconnection Networks and Systems #math.CO

paper · pdf · doi:10.48550/arxiv.1604.01887

19 pagers, 2 figures. arXiv admin note: substantial text overlap with arXiv:1603.03995, arXiv:1508.07202, arXiv:1508.07149. text overlap with arXiv:1103.6095 by other authors

arxiv created 2016/04/07 · arxiv updated 2016/04/08

Abstract

The concept of pendant-tree connectivity, introduced by Hager in 1985, is a generalization of classical vertex-connectivity. In this paper, we study pendant-tree connectivity of line graphs.

Citations

• Path connectivity of line graphs
• Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks
• On the pedant tree-connectivity of graphs
• The generalized 3-connectivity of Cartesian product graphs

Cited by

• The minimal size of graphs with given pendant-tree connectivity
• The generalized 3-(edge) connectivity of total graphs

Related

• The minimal size of graphs with given pendant-tree connectivity
• Path connectivity of line graphs
• Algebraic connectivity of connected graphs with fixed number of pendant vertices
• Graphs with large generalized (edge-)connectivity
• Algebraic Connectivity and Degree Sequences of Trees