Tree robustness of a graph

DOI10.1080/03081087.2017.1370687zbMath1392.05025OpenAlexW2750772825MaRDI QIDQ4580048

M. Arian-Nejad, R. Tusserkani

Publication date: 13 August 2018

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2017.1370687

zbMATH Keywords

robustnessspanning tree packing numberconnectivity measure

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Cites Work

• Edge-connectivity and edge-disjoint spanning trees
• On computing a conditional edge-connectivity of a graph
• On a class of posets and the corresponding comparability graphs
• The average connectivity of a graph
• Network analysis. Methodological foundations.
• Tough graphs and Hamiltonian circuits.
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Conditional connectivity
• The cohesiveness of a point of a graph
• On the spanning tree packing number of a graph: A survey
• Unnamed Item
• Unnamed Item

This page was built for publication: Tree robustness of a graph