Fundamental dominations in graphs
From MaRDI portal
Publication:2999983
zbMATH Open1220.05086arXiv0808.4022MaRDI QIDQ2999983FDOQ2999983
Authors: Arash Behzad, Mehdi Behzad, Cheryl E. Praeger 
Publication date: 18 May 2011
Abstract: Nine variations of the concept of domination in a simple graph are identified as fundamental domination concepts, and a unified approach is introduced for studying them. For each variation, the minimum cardinality of a subset of dominating elements is the corresponding fundamental domination number. It is observed that, for each nontrivial connected graph, at most five of these nine numbers can be different, and inequalities between these five numbers are given. Finally, these fundamental dominations are interpreted in terms of the total graph of the given graph, a concept introduced by the second author in 1965. It is argued that the very first domination concept, defined by O. Ore in 1962 and under a different name by C. Berge in 1958, deserves to be called the most fundamental of graph dominations.
Full work available at URL: https://arxiv.org/abs/0808.4022
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cited In (1)
This page was built for publication: Fundamental dominations in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999983)
