Fundamental Dominations in Graphs

Details Fundamental Dominations in Graphs Fundamental Dominations in Graphs

2008-08-29

arxiv.org/abs/0808.4022v1

Mathematics

Combinatorics

15 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Fundamental Dominations in Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fundamental Dominations in Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fundamental Dominations in Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-542336