A note on the cycle isolation number of graphs

DOI10.1007/s40840-024-01655-xOpenAlexW4391604362WikidataQ128244826 ScholiaQ128244826MaRDI QIDQ6202043

Baoyindureng Wu, Gang Zhang

Publication date: 21 February 2024

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-024-01655-x

zbMATH Keywords

cyclesdominationpartial dominationisolating sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (1)

Cycle isolation of graphs with small girth

Cites Work

• Unnamed Item
• Admissible property of graphs in terms of radius
• Admissible property of graphs in terms of independence number
• Isolation of the diamond graph
• Isolation of \(k\)-cliques. II
• Isolation of cycles
• Isolation of \(k\)-cliques
• Partial domination of maximal outerplanar graphs
• Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph
• \( K_{1 , 2}\)-isolation in graphs
• Isolation number of maximal outerplanar graphs
• Extensions of the Art Gallery Theorem
• Partial domination - the isolation number of a graph

This page was built for publication: A note on the cycle isolation number of graphs