Search
Abstract
A set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number equal to n/3 . Moreover, we provide a family of general graphs attaining this upper bound on the isolation number.
Citations
-
1
CrossRef
-
0
Web of Science
-
0
Scopus
Authors (3)
-
Merce Mora Prof
-
Maria Jose Souto Salorio Prof
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach
- Published in:
-
DISCRETE MATHEMATICS
no. 347,
ISSN: 0012-365X - Language:
- English
- Publication year:
- 2024
- Bibliographic description:
- Lemańska M., Mora M., Souto Salorio M. J.: Graphs with isolation number equal to one third of the order// DISCRETE MATHEMATICS -,iss. 5 (2024),
- DOI:
- Digital Object Identifier (open in new tab) 10.1016/j.disc.2024.113903
- Sources of funding:
-
- COST_FREE
- Verified by:
- Gdańsk University of Technology
seen 12 times
Recommended for you
Isolation Number versus Domination Number of Trees
- M. Lemańska,
- M. J. Souto-Salorio,
- A. Dapena
- + 1 authors
2021