• NEIGHBORHOOD CONNECTED EQUITABLE EDGE DOMINATION IN GRAPHS
Abstract
Let G = (V, E) be a graph, for any edge fE(G) the degree of f=uv in G is defined by deg(f)=deg(u)+deg(v) 2. A set FE for edges is an equitable edge dominating set of G if every edge f not in F is adjacent to at least one edge such that . The minimum cardinality of such equitable edge dominating set is denoted by and is called equitable edge domination number of G. In this paper we introduced The connected equitable edge domination and neighbourhood connected equitable edge domination in a graphs exact value for the some standard graphs bounds and some interesting results are obtained.
Keywords
Equitable edge dominating set, connected equitable edge dominating set, Neighborhood connected equitable edge dominating set.
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 |