Please use this identifier to cite or link to this item: https://idr.nitk.ac.in/jspui/handle/123456789/13053
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBhat, R.S.-
dc.contributor.authorSowmya, Kamath S.-
dc.contributor.authorBhat, S.R.-
dc.date.accessioned2020-03-31T08:45:12Z-
dc.date.available2020-03-31T08:45:12Z-
dc.date.issued2012-
dc.identifier.citationApplied Mathematical Sciences, 2012, Vol.6, 109-112, pp.5525-5531en_US
dc.identifier.urihttps://idr.nitk.ac.in/jspui/handle/123456789/13053-
dc.description.abstractFor 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, e-dominates an edge y if y ? (N[x]). A set L ? E is an Edge-Edge Dominating Set (EED-set) if every edge in E-L is e-dominated by an edge in L. The edge-edge domination number ? ee(G) is the cardinality of a minimum EED-set. We find the relation ship between the new parameter and some known graph parameters.en_US
dc.titleStrong (weak) edge-edge domination number of a graphen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
File Description SizeFormat 
13053.pdf155.21 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.