We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Mathematics/NEIGHBORHOOD CONNECTED EQUITABLE EDGE DOMINATION IN GRAPHS
PeriodicalsMathematics

NEIGHBORHOOD CONNECTED EQUITABLE EDGE DOMINATION IN GRAPHS

Checking your access to this record.

Abstract & Overview

Let G = (V, E) be a graph, for any edge fE(G) the degree of f=uv in G is defined by deg(f)=deg(u)+deg(v) 2. A set FE 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.

Cite this record

S. Sivakumar, N. D. Soner, Anwar Alwardi (2013). NEIGHBORHOOD CONNECTED EQUITABLE EDGE DOMINATION IN GRAPHS. Research journal of pure algebra, 3(3). https://library.shubhaarti.com/content/71b95b72-bf54-4be4-8bd6-2553332fa76a

Copy in another style

Sivakumar, S., Soner, N. D., & Alwardi, A. (2013). NEIGHBORHOOD CONNECTED EQUITABLE EDGE DOMINATION IN GRAPHS. Research journal of pure algebra, 3(3). https://library.shubhaarti.com/content/71b95b72-bf54-4be4-8bd6-2553332fa76a
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.