A note on connected dominating sets of distance-hereditary graphs

DOI10.1016/J.DAM.2012.02.003MaRDI QIDQ423975zbMATH OpenOpenAlexFDO

Authors Oliver Schaudt

Publication date 30 May 2012

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

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

zbMATH Keywords

connected dominating setsdistance-hereditary graphsstructural domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Connectivity (05C40)

Recommendations

• Weighted connected domination and Steiner trees in distance-hereditary graphs
• Hereditarily dominated graphs
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs
• A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs

Cites work

• scientific article; zbMATH DE number 4063149 (Why is no real title available?)
• scientific article; zbMATH DE number 2192152 (Why is no real title available?)
• scientific article; zbMATH DE number 2209525 (Why is no real title available?)
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
• Complete description of forbidden subgraphs in the structural domination problem
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• Distance-hereditary graphs
• Dominating and large induced trees in regular graphs
• Dominating cliques in distance-hereditary graphs
• Graph Classes: A Survey
• Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
• Locally well-dominated and locally independent well-dominated graphs
• On the clique-width of some perfect graph classes
• Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs
• Well paired-dominated graphs

Cited in

(6)

• The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
• A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
• Linear separation of connected dominating sets in graphs
• Weighted connected domination and Steiner trees in distance-hereditary graphs
• On dominating sets whose induced subgraphs have a bounded diameter
• Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible

This page was built for publication: A note on connected dominating sets of distance-hereditary graphs

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