Distance domination versus iterated domination
DOI10.1016/J.DISC.2011.12.008zbMATH Open1246.05113OpenAlexW2010738039MaRDI QIDQ442389FDOQ442389
Authors: Gábor Bacsó, Zsolt Tuza
Publication date: 10 August 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.12.008
Recommendations
- Distance domination in graphs
- Distance independent domination in iterated line graphs
- Distance domination and distance irredundance in graphs
- On domination number and distance in graphs
- scientific article; zbMATH DE number 146666
- scientific article; zbMATH DE number 844146
- Bounds for distance domination numbers of graphs
- Distance domination in partitioned graphs
- Graph Domination in Distance Two
- Distance \(d\)-domination games
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
- A survey of hereditary properties of graphs
- Complete description of forbidden subgraphs in the structural domination problem
- Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
- Title not available (Why is that?)
- Graph Domination in Distance Two
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: Distance domination versus iterated domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442389)