Abstract
Abstract 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.
Citations
-
1 1
CrossRef
-
0
Web of Science
-
1 5
Scopus
Authors (3)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
Bulletin of the Malaysian Mathematical Sciences Society
no. 39,
pages 199 - 217,
ISSN: 0126-6705 - Language:
- English
- Publication year:
- 2016
- Bibliographic description:
- Kuziak D., Lemańska M., Yero I.: Domination-Related Parameters in Rooted Product Graphs// Bulletin of the Malaysian Mathematical Sciences Society. -Vol. 39, nr. 1 (2016), s.199-217
- DOI:
- Digital Object Identifier (open in new tab) 10.1007/s40840-015-0182-5
- Verified by:
- Gdańsk University of Technology
seen 132 times
Recommended for you
Total Domination Versus Domination in Cubic Graphs
- J. Cyman,
- M. Dettlaff,
- M. A. Henning
- + 2 authors
2018
Independent Domination Subdivision in Graphs
- A. Babikir,
- M. Dettlaff,
- M. A. Henning
- + 1 authors
2021