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 |
| id |
2-s2.0-85191179713 |
|---|---|
| spelling |
2-s2.0-85191179713 Hasni R.; Mojdeh D.A.; Bakar S.A. Domination (totally) Dot-critical of Harary Graphs 2024 Malaysian Journal of Mathematical Sciences 18 1 10.47836/mjms.18.1.01 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85191179713&doi=10.47836%2fmjms.18.1.01&partnerID=40&md5=ed9f6730d455bc6902e10af1b31d0287 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. Universiti Putra Malaysia 18238343 English Article All Open Access; Bronze Open Access |
| author |
Hasni R.; Mojdeh D.A.; Bakar S.A. |
| spellingShingle |
Hasni R.; Mojdeh D.A.; Bakar S.A. Domination (totally) Dot-critical of Harary Graphs |
| author_facet |
Hasni R.; Mojdeh D.A.; Bakar S.A. |
| author_sort |
Hasni R.; Mojdeh D.A.; Bakar S.A. |
| title |
Domination (totally) Dot-critical of Harary Graphs |
| title_short |
Domination (totally) Dot-critical of Harary Graphs |
| title_full |
Domination (totally) Dot-critical of Harary Graphs |
| title_fullStr |
Domination (totally) Dot-critical of Harary Graphs |
| title_full_unstemmed |
Domination (totally) Dot-critical of Harary Graphs |
| title_sort |
Domination (totally) Dot-critical of Harary Graphs |
| publishDate |
2024 |
| container_title |
Malaysian Journal of Mathematical Sciences |
| container_volume |
18 |
| container_issue |
1 |
| doi_str_mv |
10.47836/mjms.18.1.01 |
| url |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85191179713&doi=10.47836%2fmjms.18.1.01&partnerID=40&md5=ed9f6730d455bc6902e10af1b31d0287 |
| description |
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. |
| publisher |
Universiti Putra Malaysia |
| issn |
18238343 |
| language |
English |
| format |
Article |
| accesstype |
All Open Access; Bronze Open Access |
| record_format |
scopus |
| collection |
Scopus |
| _version_ |
1809677885422698496 |