Back to Search
Start Over
Secure equitability in graphs.
- Source :
-
Discrete Mathematics, Algorithms & Applications . Feb2023, Vol. 15 Issue 2, p1-21. 21p. - Publication Year :
- 2023
-
Abstract
- In secure domination [A. P. Burger, M. A. Henning and J. H. Van Vuuren, Vertex covers and secure domination in graphs, Quaest Math. 31 (2008) 163–171; E. J. Cockayne, Irredundance, secure domination and maximum degree in trees, Discrete Math. 307(1) (2007) 12–17; E. J. Cockayne, O. Favaron and C. M. Mynhardt, Secure domination, weak Roman domination and forbidden subgraph, Bull. Inst. Combin. Appl. 39 (2003) 87–100; C. M. Mynhardt, H. C. Swart and E. Ungerer, Excellent trees and secure domination, Util. Math. 67 (2005) 255–267], a vertex outside has the chance of coming inside the dominating set by replacing an element of the set without affecting domination. This idea is combined with equitability. Secure equitable dominating set is introduced and studied. Other concepts like independence and rigid security are also studied in this paper. [ABSTRACT FROM AUTHOR]
- Subjects :
- *MATHEMATICS
Subjects
Details
- Language :
- English
- ISSN :
- 17938309
- Volume :
- 15
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics, Algorithms & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 162157137
- Full Text :
- https://doi.org/10.1142/S1793830922500811