Graph Domination in Distance Two

DOI10.7151/DMGT.1266MaRDI QIDQ5316266zbMATH OpenOpenAlexFDO

Authors Gábor Bacsó, Attila Tálos, Zsolt Tuza

Publication date 12 September 2005

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1266

zbMATH Keywords

\(k\)-dominating subgraphdominating set

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• Distance domination in graphs
• On domination number and distance in graphs
• scientific article; zbMATH DE number 844146
• Bounds on the distance two-domination number of a graph
• Distance domination in graphs with given minimum and maximum degree
• Distance domination and distance irredundance in graphs
• Graphs with equal domination and 2-distance domination numbers
• Distance domination in partitioned graphs
• Distance domination-critical graphs
• Distance neighbourhood domination in graphs

Cited in

(6)

• Complete description of forbidden subgraphs in the structural domination problem
• Distance-2 domatic numbers of grid graphs
• Distance domination versus iterated domination
• Domination properties and induced subgraphs
• Hereditarily dominated graphs
• Infinite versus finite graph domination

This page was built for publication: Graph Domination in Distance Two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316266)