Bhat, R S and Kamath , S S and Bhat, Surekha R (2012) Strong (Weak) EdgeEdge Domination Number of a Graph. Applied Mathematical Sciences, 6 (111). 5525`5531. ISSN 1312885X

PDF
Hikari_paper.pdf  Published Version Download (109kB) 
Official URL: http://www.mhikari.com/ams/ams2012/ams1091122...
Abstract
For any edge x=uv of an isolate free graph G(V,E),(N[X]) is the subgraph induced by the vertices adjacent to u and v in G. We say that an edge x, edominates an edge y if y ∈ 〈N[x]〉 . A set L ⊆ E is an EdgeEdge Dominating Set (EEDset) if every edge in is edominated by an edge in L. The edgeedge domination number Yee(G) is the cardinality of a minimum EEDset. We find the relation ship between the new parameter and some known graph parameters.
Item Type:  Article 

Uncontrolled Keywords:  EdgeEdge Dominating sets (EED sets), Strong EdgeEdge Dominating sets (SEED sets) 
Subjects:  Engineering > MIT Manipal > Mathematics 
Depositing User:  MIT Library 
Date Deposited:  22 Sep 2012 09:01 
Last Modified:  22 Sep 2012 09:01 
URI:  http://eprints.manipal.edu/id/eprint/77250 
Actions (login required)
View Item 