Strong (weak) edge-edge domination number of a graph
| dc.contributor.author | Bhat, R.S. | |
| dc.contributor.author | Sowmya, Kamath S. | |
| dc.contributor.author | Bhat, S.R. | |
| dc.date.accessioned | 2020-03-31T08:45:12Z | |
| dc.date.available | 2020-03-31T08:45:12Z | |
| dc.date.issued | 2012 | |
| dc.description.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, 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.identifier.citation | Applied Mathematical Sciences, 2012, Vol.6, 109-112, pp.5525-5531 | en_US |
| dc.identifier.uri | https://idr.nitk.ac.in/jspui/handle/123456789/13053 | |
| dc.title | Strong (weak) edge-edge domination number of a graph | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1