A sharp upper bound on the cycle isolation number of graphs

DOI10.1007/s00373-023-02717-wMaRDI QIDQ6083190

Jingshu Zhang, Qing Cui

Publication date: 31 October 2023

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

zbMATH Keywords

partial dominationcycle isolating setcycle isolation number

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)

Related Items (1)

Cycle isolation of graphs with small girth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of selected recent results on total domination in graphs
• On graphs having domination number half their order
• 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
• Domination-balanced graphs
• Total Domination in Graphs
• Partial domination - the isolation number of a graph
• \( P_5\)-isolation in graphs
• Isolation of connected graphs
• Partial domination and irredundance numbers in graphs

This page was built for publication: A sharp upper bound on the cycle isolation number of graphs