Independence andk-domination in graphs
From MaRDI portal
Publication:2995488
DOI10.1080/00207160.2010.482664zbMATH Open1210.05096OpenAlexW2057788370MaRDI QIDQ2995488FDOQ2995488
Dirk Meierling, Adriana Hansberg, Lutz Volkmann
Publication date: 21 April 2011
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2010.482664
Cites Work
Cited In (18)
- Relating the annihilation number and the 2-domination number of a tree
- A note on the annihilation number and 2-domination number of a tree
- Trees with 2-reinforcement number three
- Trees with maximum \(p\)-reinforcement number
- Title not available (Why is that?)
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Independence and graph homomorphisms graph homomorphisms
- Domination number, independent domination number and 2-independence number in trees
- On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
- Multiple Domination
- Title not available (Why is that?)
- Title not available (Why is that?)
- The annihilation number does not bound the 2-domination number from the above
- k-Independence and thek-residue of a graph
- On \(k\)-domination and \(j\)-independence in graphs
- Cycle domination, independence, and irredundance in graphs
- Relating the annihilation number and the 2-domination number of block graphs
- New results on \(k\)-independence of graphs
This page was built for publication: Independence andk-domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2995488)
