Cycle isolation in graphs

DOI10.1016/J.DAM.2025.06.058MaRDI QIDQ6906770zbMATH OpenFDO

Authors Yanfang Liang, Baoyindureng Wu

Publication date 4 November 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.06.058

zbMATH Keywords

partial-dominationcycle isolation number\(\{C_k \}\)-isolation number

Mathematics Subject Classification ID

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

Cites work

• A note on the cycle isolation number of graphs
• Admissible property of graphs in terms of independence number
• Admissible property of graphs in terms of radius
• Cycle isolation of graphs with small girth
• Extensions of the Art Gallery Theorem
• Graph theory
• Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph
• Isolation number of maximal outerplanar graphs
• Isolation of \(k\)-cliques. II
• Isolation of cycles
• Isolation of squares in graphs
• On the cycle isolation number of triangle-free graphs
• Partial domination -- the isolation number of a graph
• Partial domination of maximal outerplanar graphs
• \( K_{1 , 2}\)-isolation in graphs

Cited in

(2)

• Proof of a conjecture on isolation of cycles in graphs
• On decycling and forest numbers of Cartesian products of trees

This page was built for publication: Cycle isolation in graphs

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