Domination Value in Graphs

View Full Paper

Ask AI

Bookmark

Authors

Discussion

The paper characterizes domination value in graphs, including Petersen and complete n-partite graphs, revealing important properties.

A dominating set of minimum cardinality is known as a γ(G)-set, and offers insight into graph structure.
For each vertex in a graph, the domination value indicates how many γ(G)-sets it belongs to, highlighting local properties.
Key findings include characterizations of domination value for specific graph types such as cycles and paths.
This research enhances understanding of edge connections and interactions in graph theory, promoting further exploration.

Eunjeong Yi (2012) studied this question.

View Full Paper

Ask AI

Bookmark