Domination related parameters in rooted product graphs

Details Domination related parameters in rooted product graphs Domination related parameters in rooted product graphs

2012-04-03

arxiv.org/abs/1204.0644v1

Mathematics

Combinatorics

16 pages

Scientific paper

A set $S$ of vertices of a graph $G$ is a dominating set in $G$ if every vertex outside of $S$ is adjacent to at least one vertex belonging to $S$. A domination parameter of $G$ is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of $G$. Here, we investigate several domination related parameters in rooted product graphs.

Affiliated with

Also associated with

No associations

Rating

Domination related parameters in rooted product graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Domination related parameters in rooted product graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Domination related parameters in rooted product graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-354855