Abstract
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.
Citations
-
1 1
CrossRef
-
0
Web of Science
-
1 7
Scopus
Authors (4)
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:
-
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES INDIA SECTION A-PHYSICAL SCIENCES
no. 85,
edition 3,
pages 353 - 357,
ISSN: 0369-8203 - Language:
- English
- Publication year:
- 2015
- Bibliographic description:
- Lemańska M., Swaminathan V., Venkatakrishnan Y., Zuazua R.: Super Dominating Sets in Graphs// PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES INDIA SECTION A-PHYSICAL SCIENCES. -Vol. 85, iss. 3 (2015), s.353-357
- DOI:
- Digital Object Identifier (open in new tab) 10.1007/s40010-015-0208-2
- Verified by:
- Gdańsk University of Technology
seen 78 times
Recommended for you
Bounds on the vertex-edge domination number of a tree
- B. Krishnakumari,
- Y. B. Venkatakrishnan,
- M. Krzywkowski
2014