Graphs with total isolation number equal to half the order
From MaRDI portal
Cites work
- \( K_{1 , 2}\)-isolation in graphs
- \( P_5\)-isolation in graphs
- \(k\)-isolation in graphs
- A characterization of graphs with maximum k-clique isolation number
- A characterization of graphs with maximum cycle isolation number
- A sharp upper bound on the cycle isolation number of graphs
- Admissible property of graphs in terms of radius
- Bounds on independent isolation in graphs
- Cycle isolation in graphs
- Cycle isolation of graphs with small girth
- Disjoint isolating sets and graphs with maximum isolation number
- Extensions of the Art Gallery Theorem
- Graphs with isolation number equal to one third of the order
- scientific article; zbMATH DE number 1529462 (Why is no real title available?)
- 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 connected graphs in terms of size
- Isolation of cycles
- Isolation of regular graphs and \(k\)-chromatic graphs
- Isolation of regular graphs, stars and k-chromatic graphs
- Isolation of squares in graphs
- New results on the 1-isolation number of graphs without short cycles
- On the cycle isolation number of triangle-free graphs
- On total isolation in graphs
- Partial domination -- the isolation number of a graph
- Partial domination and irredundance numbers in graphs
- Partial domination of hypergraphs
- Partial domination of maximal outerplanar graphs
- Proof of a conjecture on isolation of graphs dominated by a vertex
- Solution to a 3-path isolation problem for subcubic graphs
- Total domination in graphs
- Total isolation of k-cliques in a graph
This page was built for publication: Graphs with total isolation number equal to half the order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7362409)
