Private Edge Domination Number of a Graph
Keywords:Edge domination, Perfect domination, Private domination, Edge irredundant sets.
A set is said to be a private edge dominating set, if it is an edge dominating set, for every has at least one external private neighbor in . Let and denote the minimum and maximum cardinalities, respectively, of a private edge dominating sets in a graph . In this paper we characterize connected graph for which ? q/2 and the graph for some upper bounds. The private edge domination numbers of several classes of graphs are determined.
Keywords: Edge domination; Perfect domination; Private domination; Edge irredundant sets.
© 2013 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved.
doi: http://dx.doi.org/10.3329/jsr.v5i2.12024 J. Sci. Res. 5 (2), 283-294 (2013)
How to Cite
© Journal of Scientific Research
Articles published in the "Journal of Scientific Research" are Open Access articles under a Creative Commons Attribution-ShareAlike 4.0 International license (CC BY-SA 4.0). This license permits use, distribution and reproduction in any medium, provided the original work is properly cited and initial publication in this journal. In addition to that, users must provide a link to the license, indicate if changes are made and distribute using the same license as original if the original content has been remixed, transformed or built upon.