On weakly connected domination in graphs. II.

DOI10.1016/J.DISC.2005.10.006zbMath1078.05064OpenAlexW4210765591MaRDI QIDQ2581406

Johannes H. Hattingh, Gayla S. Domke, Lisa R. Markus

Publication date: 10 January 2006

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.10.006

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

On \(\alpha\)-excellent graphs ⋮ Bounds relating the weakly connected domination number to the total domination number and the matching number ⋮ Some variations of perfect graphs ⋮ Connected Domination ⋮ Weakly connected Roman domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On weakly connected domination in graphs
• A characterization of \(i\)-excellent trees
• Perfect graphs of strong domination and independent strong domination
• WELL-COVERED GRAPHS: A SURVEY
• Perfect connected-dominant graphs
• Characterizations of trees with equal domination parameters
• An induced subgraph characterization of domination perfect graphs
• Some covering concepts in graphs

This page was built for publication: On weakly connected domination in graphs. II.