Proper 3-Dominating Sets in Graphs
A dominating set is a classic concept that is widely used in road safety, disaster rescue operations, and chemical graphs. In this paper, we introduce a variation of the dominating set: the proper 3-dominating set. For a proper 3-dominating set <i>D</i> of graph <inline-formula><...
Saved in:
| Main Authors: | Danmei Chen, Shuangjie Cai |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-06-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/12/1960 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Minimum Neighborhood Domination of Split Graph of Graphs
by: ANJALINE. W, et al.
Published: (2023-03-01) -
Some results on domination in annihilating-ideal graphs of commutative rings
by: Reza Taheri
Published: (2025-06-01) -
Characterization of Some Claw-Free Graphs in Co-Secure Domination Number
by: Yuexin Zhang, et al.
Published: (2025-07-01) -
On the Domination Numbers of Certain Prism Graphs
by: Ayhan Ahmed Al-Shumam
Published: (2022-12-01) -
Geodetic Domination Integrity of Thorny Graphs
by: Şeyma Onur, et al.
Published: (2024-03-01)