Equitable Domination to the Cross Product of Special Graph
Author(s):
Kavitha B N , Sri Venkateshwara College of Engineering ; Dr. Indrani Kelkar, AVP Academics
Keywords:
Complete Graph, Complete Bipartite graph, Path, cycle, Cross Product graph, Domination, Equitable Domination
Abstract:
A subset D of V (G) is called an equitable dominating set of a graph G if for every v ∈ (V − D), there exists a vertex u ∈ D such that uv∈ E(G) and |deg(u) − deg(v)| ≤ 1. The minimum cardinality of such a dominating set is denoted by γ^e (G) and is called equitable domination number of G. In this paper we introduce the Equitable domination to the cross product of special graph.
Other Details:
| Manuscript Id | : | IJSTEV3I10108
|
| Published in | : | Volume : 3, Issue : 10
|
| Publication Date | : | 01/05/2017
|
| Page(s) | : | 232-236
|
Download Article
