Characterization of graphs with equal domination and covering number

DOI10.1016/S0012-365X(98)00103-4zbMath0955.05088MaRDI QIDQ1584421

Bert Randerath, Lutz Volkmann

Publication date: 2 November 2000

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

zbMATH Keywords

extremal graphsdominating setcovering numberdomination numberconnected graphscovering set

Mathematics Subject Classification ID

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

Related Items (17)

Domination in intersecting hypergraphs ⋮ Relations between the Roman k-domination and Roman domination numbers in graphs ⋮ Graphs with constant sum of domination and inverse domination numbers ⋮ A constructive characterization of vertex cover Roman trees ⋮ Star-uniform graphs ⋮ Equality of domination and transversal numbers in hypergraphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Unnamed Item ⋮ Domination in graphs of minimum degree at least two and large girth ⋮ On graphs with equal domination and 2-domination numbers ⋮ Graphs with equal domination and covering numbers ⋮ Domination and matching in power and generalized power hypergraphs ⋮ Connected Domination ⋮ Bipartite graphs with close domination and \(k\)-domination numbers ⋮ Bipartization of graphs ⋮ Outer independent global dominating set of trees and unicyclic graphs ⋮ On the edge geodetic and edge geodetic domination numbers of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On graphs having domination number half their order
• On graphs with equal domination and covering numbers
• Extremal graphs for inequalities involving domination parameters
• Domination-balanced graphs
• The 1-Factors of Oriented Graphs

This page was built for publication: Characterization of graphs with equal domination and covering number