• NEIGHBOURHOOD CONNECTED 2-EQUITABLE DOMINATION IN GRAPHS
Abstract
Let G= (V, E) be a graph, two vertices u and v in V said to be equitable adjacent, if u and v are adjacent in 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 neighbourhood connected 2-equitable domination number in graph, exact value for some standard graphs bounds and some interesting results are obtained.
Keywords
Equitable domination number,2-equitable dominating set, Neighbourhood Connected 2-equitable dominate- on in Graphs, chromatic number.
Full Text:
PDFRefbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
| © 2011-2024 Research Journal of Pure Algebra (RJPA) Copyright Agreement & Authorship Responsibility | Counter |