ON HOP DOMINATION NUMBER OF SOME GENERALIZED GRAPH STRUCTURES
A subset \( H \subseteq V (G) \) of a graph \(G\) is a hop dominating set (HDS) if for every \({v\in (V\setminus H)}\) there is at least one vertex \(u\in H\) such that \(d(u,v)=2\). The minimum cardinality of a hop dominating set of \(G\) is called the hop domination number of \(G\) and is denote...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ural Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin, Krasovskii Institute of Mathematics and Mechanics
2021-12-01
|
| Series: | Ural Mathematical Journal |
| Subjects: | |
| Online Access: | https://umjuran.ru/index.php/umj/article/view/399 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|