Tree robustness of a graph

DOI10.1080/03081087.2017.1370687MaRDI QIDQ4580048zbMATH OpenOpenAlexFDO

Authors M. Ariannejad, 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) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Robustness of graph properties
• Robust subgraphs for trees and paths
• Algorithm Theory - SWAT 2004
• scientific article; zbMATH DE number 7055493
• scientific article; zbMATH DE number 1109405
• On connectivities of tree graphs
• Tree-core and tree-coritivity of graphs
• On tree roots of graphs
• scientific article; zbMATH DE number 4051653

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• Conditional connectivity
• Edge-Disjoint Spanning Trees of Finite Graphs
• Edge-connectivity and edge-disjoint spanning trees
• Network analysis. Methodological foundations.
• On a class of posets and the corresponding comparability graphs
• On computing a conditional edge-connectivity of a graph
• On the Problem of Decomposing a Graph into n Connected Factors
• On the spanning tree packing number of a graph: A survey
• The average connectivity of a graph
• The cohesiveness of a point of a graph
• The wonderful Walecki construction
• Tough graphs and Hamiltonian circuits.

Cited in

(2)

• Robust connectivity of graphs on surfaces
• Robust graph ideals

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580048)