In this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.
Authors
- dr inż. Magdalena Lemańska link open in new tab ,
- V. Swaminathan,
- Y. Venkatakrishnan,
- R. Zuazua
Additional information
- DOI
- Digital Object Identifier link open in new tab 10.1007/s40010-015-0208-2
- Category
- Publikacja w czasopiśmie
- Type
- artykuł w czasopiśmie wyróżnionym w JCR
- Language
- angielski
- Publication year
- 2015
Source: MOSTWiedzy.pl - publication "Super Dominating Sets in Graphs" link open in new tab
