Distance domination versus iterated domination

DOI10.1016/j.disc.2011.12.008zbMath1246.05113OpenAlexW2010738039MaRDI QIDQ442389

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

zbMATH Keywords

dominating setforbidden induced subgraphclass of connected graphsdistance domination

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Exponential domination in subcubic graphs ⋮ Bounds on the exponential domination number ⋮ Distance Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Complete description of forbidden subgraphs in the structural domination problem
• Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
• A survey of hereditary properties of graphs
• Graph Domination in Distance Two

This page was built for publication: Distance domination versus iterated domination