Search
Abstract
If G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G). In this paper, we analyze a family of trees T where ι(T)=γ(T), and we prove that ι(T)=n3 implies ι(T)=γ(T). Moreover, we give different equivalent characterizations of such graphs and we propose simple algorithms to build these trees from the connections of stars.
Citations
-
3
CrossRef
-
0
Web of Science
-
3
Scopus
Authors (4)
-
Maria Jose Souto-Salorio prof
-
Adriana Dapena prof.
-
Francisco Vazquez-Araujo dr
Cite as
Full text
download paper
downloaded 53 times
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.3390/math9121325
- License
-
open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach
- Published in:
-
Mathematics
no. 9,
ISSN: 2227-7390 - Language:
- English
- Publication year:
- 2021
- Bibliographic description:
- Lemańska M., Souto-Salorio M. J., Dapena A., Vazquez-Araujo F.: Isolation Number versus Domination Number of Trees// Mathematics -Vol. 9,iss. 12 (2021),
- DOI:
- Digital Object Identifier (open in new tab) 10.3390/math9121325
- Verified by:
- Gdańsk University of Technology
seen 115 times
Recommended for you
Bounds on the vertex-edge domination number of a tree
- B. Krishnakumari,
- Y. B. Venkatakrishnan,
- M. Krzywkowski
2014