On dominating sets whose induced subgraphs have a bounded diameter

DOI10.1016/J.DAM.2013.05.030MaRDI QIDQ2444556zbMATH OpenOpenAlexFDO

Authors Oliver Schaudt

Publication date 10 April 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2013.05.030

zbMATH Keywords

dominating setsensor networkschordal graph

Mathematics Subject Classification ID

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)

Recommendations

• On connected dominating sets of restricted diameter
• On connected domination in unit ball graphs
• scientific article; zbMATH DE number 2044937
• scientific article; zbMATH DE number 1247724
• Approximation algorithms for connected dominating sets

Cites work

• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1124601 (Why is no real title available?)
• scientific article; zbMATH DE number 2204179 (Why is no real title available?)
• scientific article; zbMATH DE number 2209525 (Why is no real title available?)
• A note on connected dominating sets of distance-hereditary graphs
• Algorithmic graph theory and perfect graphs
• Complete description of forbidden subgraphs in the structural domination problem
• Dominating cliques in chordal graphs
• Dominating cliques in graphs
• Dominating sets for split and bipartite graphs
• Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
• NP-completeness and degree restricted spanning trees
• Nordhaus-Gaddum results for weakly convex domination number of a graph
• The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs

Cited in

(3)

• Construction and estimation of dominating sets in communication structures
• The optimal design of low-latency virtual backbones
• On connected dominating sets of restricted diameter

This page was built for publication: On dominating sets whose induced subgraphs have a bounded diameter

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