Strong (weak) edge-edge domination number of a graph

R. S. Bhat, S. S. Kamath, Surekha R. Bhat

Research output: Contribution to journalArticle

1 Citation (Scopus)

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.

Original languageEnglish
Pages (from-to)5525-5531
Number of pages7
JournalApplied Mathematical Sciences
Volume6
Issue number109-112
Publication statusPublished - 16-10-2012

Fingerprint

Domination number
Dominating Set
Ships
Induced Subgraph
Graph in graph theory
Cardinality
Adjacent
Relationships

All Science Journal Classification (ASJC) codes

  • Applied Mathematics

Cite this

Bhat, R. S., Kamath, S. S., & Bhat, S. R. (2012). Strong (weak) edge-edge domination number of a graph. Applied Mathematical Sciences, 6(109-112), 5525-5531.
Bhat, R. S. ; Kamath, S. S. ; Bhat, Surekha R. / Strong (weak) edge-edge domination number of a graph. In: Applied Mathematical Sciences. 2012 ; Vol. 6, No. 109-112. pp. 5525-5531.
@article{7e80fc1ad05a4a1b8d68295c6724acb2,
title = "Strong (weak) edge-edge domination number of a graph",
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.",
author = "Bhat, {R. S.} and Kamath, {S. S.} and Bhat, {Surekha R.}",
year = "2012",
month = "10",
day = "16",
language = "English",
volume = "6",
pages = "5525--5531",
journal = "Applied Mathematical Sciences",
issn = "1312-885X",
publisher = "Hikari Ltd.",
number = "109-112",

}

Bhat, RS, Kamath, SS & Bhat, SR 2012, 'Strong (weak) edge-edge domination number of a graph', Applied Mathematical Sciences, vol. 6, no. 109-112, pp. 5525-5531.

Strong (weak) edge-edge domination number of a graph. / Bhat, R. S.; Kamath, S. S.; Bhat, Surekha R.

In: Applied Mathematical Sciences, Vol. 6, No. 109-112, 16.10.2012, p. 5525-5531.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Strong (weak) edge-edge domination number of a graph

AU - Bhat, R. S.

AU - Kamath, S. S.

AU - Bhat, Surekha R.

PY - 2012/10/16

Y1 - 2012/10/16

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84867316998&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867316998&partnerID=8YFLogxK

M3 - Article

VL - 6

SP - 5525

EP - 5531

JO - Applied Mathematical Sciences

JF - Applied Mathematical Sciences

SN - 1312-885X

IS - 109-112

ER -

Bhat RS, Kamath SS, Bhat SR. Strong (weak) edge-edge domination number of a graph. Applied Mathematical Sciences. 2012 Oct 16;6(109-112):5525-5531.