Inequalities between the K_k-isolation number and the independent K_k-isolation number of a graph
From MaRDI portal
Publication:2217464
Recommendations
Cites work
- A note on the independent domination number in graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- scientific article; zbMATH DE number 3627237 (Why is no real title available?)
- On the ratio of the domination number and the independent domination number in graphs
- Partial domination -- the isolation number of a graph
Cited in
(27)- Isolation of the diamond graph
- Isolation of \(k\)-cliques. II
- Isolation of \(k\)-cliques
- \( K_{1 , 2}\)-isolation in graphs
- Extensions of the Art Gallery Theorem
- Isolation in graphs
- Independent partial domination
- \( P_5\)-isolation in graphs
- Isolation of connected graphs
- A sharp upper bound on the cycle isolation number of graphs
- Partial domination and irredundance numbers in graphs
- Cycle isolation of graphs with small girth
- A note on the cycle isolation number of graphs
- Extremal graphs for the \(K_{1,2}\)-isolation number of graphs
- Isolation of regular graphs and \(k\)-chromatic graphs
- \(k\)-isolation in graphs
- On the cycle isolation number of triangle-free graphs
- A note on the \(P_3\)-isolation number of a graph
- New results on the 1-isolation number of graphs without short cycles
- The independent isolation number of a tree
- Cycle isolation in graphs
- Bounds on independent isolation in graphs
- A characterization of graphs with maximum k-clique isolation number
- A characterization of graphs with maximum cycle isolation number
- Proof of a conjecture on isolation of cycles in graphs
- A note on distance-fall colorings
- Graphs with total isolation number equal to half the order
This page was built for publication: Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2217464)