Skip to content
Engineering Mathematics Letters ISSN 2049-9337

Archives › Volume 2014 (2014)

Eng. Math. Lett. 2014 (2014), Article ID 19

Degree equitable line domination in graphs

M. H. Muddebiha, U. A. Panfarosh, Anil R. Sedamkar

PDF (548.9 KB)

Abstract

A line dominating set D \subset V(L(G)) is called a degree equitable line dominating set, if for every vertex v \in V(L(G))-D there exists a vertex u \in D such that uv \in E in L(G) and |deg(u)-deg(v)| \leq 1. The minimum cardinality of vertices in such a set is called a degree equitable line dominating set in L(G) and is denoted byγ(G). In this paper, we study the graph theoretic properties ofγ(G) and many bounds were obtained in terms of elements of G and its relationships with other domination parameters were found.

Published
16 September 2014
Volume
2014 (2014)
License
CC BY 3.0

Copyright © 2014 M. H. Muddebiha, U. A. Panfarosh, Anil R. Sedamkar. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Cite this article

M. H. Muddebiha, U. A. Panfarosh, A. R. Sedamkar, Degree equitable line domination in graphs, Eng. Math. Lett. 2014 (2014), 19.

BibTeX
@article{Muddebiha2014,
  author  = {Muddebiha, M. H. and Panfarosh, U. A. and Sedamkar, Anil R.},
  title   = {Degree equitable line domination in graphs},
  journal = {Eng. Math. Lett.},
  volume  = {2014},
  year    = {2014},
  pages   = {19},
  doi     = {}
}