A result on the 3-generalized connectivity of a graph and its line graph

DOI10.1007/s40840-016-0441-0zbMath1408.05039MaRDI QIDQ1714044

Yaping Mao, Yin-Kui Li

Publication date: 31 January 2019

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-016-0441-0

zbMATH Keywords

line graph; Steiner tree; generalized connectivity

Mathematics Subject Classification ID

05C05: Trees

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C75: Structural characterization of families of graphs

05C40: Connectivity

05C76: Graph operations (line graphs, products, etc.)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs
• On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
• Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
• Pendant tree-connectivity
• Note on the hardness of generalized connectivity
• On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)
• The generalized connectivity of complete equipartition 3-partite graphs
• Note on the spanning-tree packing number of lexicographic product graphs
• The connectivity of line-graphs
• Generalized Connectivity of Graphs
• Rainbow trees in graphs and generalized connectivity
• Graphs with prescribed connectivity and line graph connectivity
• The generalized connectivity of complete bipartite graphs
• Graphs with large generalized 3-connectivity
• The generalized 3-connectivity of Lexicographic product graphs
• The generalized 3-connectivity of Cartesian product graphs