A polynomial algorithm for computing the weak rupture degree of trees

DOI10.1016/J.AMC.2019.06.019zbMATH Open1428.05298OpenAlexW2956012689WikidataQ127676326 ScholiaQ127676326MaRDI QIDQ2279643FDOQ2279643

Hongyun Yue, Yinkui Li, Zongtian Wei, Yong Liu, Chao Yue

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

graphtreealgorithmcomplexityweak rupture degree

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Tough graphs and Hamiltonian circuits.
• Title not available (Why is that?)
• On a class of posets and the corresponding comparability graphs
• Rupture degree of graphs
• Title not available (Why is that?)
• On edge-rupture degree of graphs
• Title not available (Why is that?)

Cited In (1)

• A polynomial algorithm for deciding the validity of an electrical distribution tree

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

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