A characterization of graphs with equal domination number and vertex cover number
From MaRDI portal
Publication:432542
zbMath1244.05170MaRDI QIDQ432542
Publication date: 4 July 2012
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: http://math.usm.my/bulletin/html/vol35_3_18.html
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (9)
Domination in intersecting hypergraphs ⋮ Equality of domination and transversal numbers in hypergraphs ⋮ Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees ⋮ Graphs with equal domination and covering numbers ⋮ Domination and matching in power and generalized power hypergraphs ⋮ Upper bounds on the signed \((k,k)\)-domatic number of digraphs ⋮ Bipartization of graphs ⋮ Outer independent global dominating set of trees and unicyclic graphs ⋮ Trees with 2-reinforcement number three
This page was built for publication: A characterization of graphs with equal domination number and vertex cover number