Secure monophonic domination of graphs
Let G = (V, E) be a connected graph. A monophonic dominating set M is said to be a secure monophonic dominating set Sm (abbreviated as SMD set) of G if for each v∈V \M there exists u∈M such that v is adjacent to u and Sm = {M \(u)} ∪{v} is a monophonic dominating set. The minimum cardinality of a se...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Mohaghegh Ardabili
2024-12-01
|
| Series: | Journal of Hyperstructures |
| Subjects: | |
| Online Access: | https://jhs.uma.ac.ir/article_3547_cbbf01bc4e292c3dd405e680fd1a9eb6.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|