Domination (totally) Dot-critical of Harary Graphs
A graph G is referred to as domination vertex critical if the removal of any vertex results in a reduction of the domination number. It is considered dot-critical (or totally dot-critical) if contracting any edge (or identifying any two vertices) leads to a decrease in the domination number. In this...
| Published in: | Malaysian Journal of Mathematical Sciences |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Universiti Putra Malaysia
2024
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85191179713&doi=10.47836%2fmjms.18.1.01&partnerID=40&md5=ed9f6730d455bc6902e10af1b31d0287 |
| Summary: | A graph G is referred to as domination vertex critical if the removal of any vertex results in a reduction of the domination number. It is considered dot-critical (or totally dot-critical) if contracting any edge (or identifying any two vertices) leads to a decrease in the domination number. In this concise paper, we delve into the investigation of these properties and proceed to characterize the dot-critical and totally dot-critical attributes of Harary graphs. © (2024), (Universiti Putra Malaysia). All Rights Reserved. |
|---|---|
| ISSN: | 18238343 |
| DOI: | 10.47836/mjms.18.1.01 |