Graphs with many independent vertex cuts

DOI10.1007/S00373-024-02811-7MaRDI QIDQ6581898zbMATH OpenFDO

Authors Yanan Hu, Xingzhi Zhan, Leilei Zhang

Publication date 1 August 2024

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00373-024-02811-7

zbMATH Keywords

connectivityindependent setvertex cut

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Fragile graphs with small independent cuts
• Independence number and cut-vertices
• An existence criterion for a cycle such that the vertices not included in it are independent
• On minimum cutsets in independent domination vertex critical graphs
• High connectivity keeping sets in \(n\)-connected graphs

Cites work

• Graph theory
• scientific article; zbMATH DE number 487720 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 3286813 (Why is no real title available?)

Cited in

(3)

• An existence criterion for a cycle such that the vertices not included in it are independent
• Graphs with odd and even distances between non-cut vertices
• Sparse graphs with an independent or foresty minimum vertex cut

This page was built for publication: Graphs with many independent vertex cuts

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