DOMINATION NUMBER AND WATCHING NUMBER OF SUBDIVISION CONSTRUCTION OF GRAPHS
In light of the results of a domination number of the subdivision of a graph G, we determine an upper bound of the watching number of S(G). In addition, we obtain a condition with which the upper bound becomes sharp.
Authors
- Ahmad Abbasi (ORCID: https://orcid.org/0000-0001-8467-7737)
- Ebrahim Vatandoost (ORCID: https://orcid.org/0000-0001-5883-7776)
- Kamran Mirasheh (ORCID: https://orcid.org/0009-0006-0041-4352)
Publication Details
- Journal
- Facta Universitatis Series Mathematics and Informatics
- Published
- 2025-04-16
- DOI
- https://doi.org/10.22190/fumi221126003m
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00