Endedge block domination in graphs
Abstract
For any graph G (V, E ) , a block graph B(G ) is a graph whose vertices are corresponding to the blocks of G and two vertices in B(G ) are adjacent whenever the corresponding blocks contain a common cutvertex in G . An edge dominating set of a block graph B(G ) is an endedge block dominating set if contains all endedges of B(G ) . The endedge block domination number (G ) is the minimum cardinality of an endedge block dominating set . In this paper some bounds for (G ) are obtained in terms of elements of G . Further exact values of (G ) for some standard graphs and relationships with other dominating parameters were obtained.
- Published
- 14 January 2016
- Volume
- 2016 (2016)
- License
- CC BY 3.0
Copyright © 2016 M. H. Muddebihal, Vedula Padmavathi. 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. Muddebihal, V. Padmavathi, Endedge block domination in graphs, Eng. Math. Lett. 2016 (2016), 1.
BibTeX
@article{Muddebihal2016,
author = {Muddebihal, M. H. and Padmavathi, Vedula},
title = {Endedge block domination in graphs},
journal = {Eng. Math. Lett.},
volume = {2016},
year = {2016},
pages = {1},
doi = {}
}