Domination related parameters in rooted product graphs
Combinatorics
2013-01-15 v2
Abstract
A set of vertices of a graph is a dominating set in if every vertex outside of is adjacent to at least one vertex belonging to . A domination parameter of is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of . Here, we investigate several domination related parameters in rooted product graphs.
Cite
@article{arxiv.1204.0644,
title = {Domination related parameters in rooted product graphs},
author = {Dorota Kuziak and Magdalena Lemanska and Ismael G. Yero},
journal= {arXiv preprint arXiv:1204.0644},
year = {2013}
}
Comments
18 pages