A polynomial algorithm for computing the weak rupture degree of trees

DOI10.1016/j.amc.2019.06.019zbMath1428.05298OpenAlexW2956012689WikidataQ127676326 ScholiaQ127676326MaRDI QIDQ2279643

Hongyun Yue, Zongtian Wei, Yong Liu, Chao Yue, Yin-Kui Li

Publication date: 13 December 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.06.019

zbMATH Keywords

treecomplexityalgorithmgraphweak rupture degree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a class of posets and the corresponding comparability graphs
• On edge-rupture degree of graphs
• Tough graphs and Hamiltonian circuits.
• Rupture degree of graphs

This page was built for publication: A polynomial algorithm for computing the weak rupture degree of trees