1982/03/01 by Charles Payan, Nguyen Huy Xuong · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Dominating set #Combinatorics #Mathematics #Vertex (graph theory) #Domination analysis #Graph #Maximal independent set #Discrete mathematics #Complement (music) #Neighbourhood (mathematics) #Independent set #Pathwidth #Line graph
paper · doi:10.1002/jgt.3190060104
openalex publication_date 1982/03/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/24
Abstract A set D of vertices in a graph is said to be a dominating set if every vertex not in D is adjacent to some vertex in D. The domination number β( G ) of a graph G is the size of a smallest dominating set. G is called domination balanced if its vertex set can be partitioned into β( G ) subsets so that each subset is a smallest dominating set of the complement G of G. The purpose of this paper is to characterize these graphs.