A characterization of graphs with maximum cycle isolation number
From MaRDI portal
Cites work
- \( K_{1 , 2}\)-isolation in graphs
- \( P_5\)-isolation in graphs
- \(k\)-isolation in graphs
- \(K_{1, 2}\)-isolation number of claw-free cubic graphs
- A note on the cycle isolation number of graphs
- A sharp upper bound on the cycle isolation number of graphs
- A survey of selected recent results on total domination in 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
- Disjoint isolating sets and graphs with maximum isolation number
- Domination-balanced graphs
- Extensions of the Art Gallery Theorem
- Graphs with isolation number equal to one third of the order
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Independent domination in graphs: A survey and recent results
- 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
- Isolation of \(k\)-cliques. II
- Isolation of connected graphs
- Isolation of cycles
- Isolation of regular graphs and \(k\)-chromatic graphs
- Isolation of squares in graphs
- Isolation of the diamond graph
- On graphs having domination number half their order
- On the cycle isolation number of triangle-free graphs
- Partial domination -- the isolation number of a graph
- Partial domination and irredundance numbers in graphs
- Partial domination of maximal outerplanar graphs
Cited in
(2)
This page was built for publication: A characterization of graphs with maximum cycle isolation number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021387)
