Hop Domination in Graphs-II
Let G = (V;E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V - S, there exists u ∈ S such that d(u; v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted by γh(G). In this paper we characterize the family of tr...
I tiakina i:
| Ngā kaituhi matua: | , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Sciendo
2015-06-01
|
| Rangatū: | Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica |
| Ngā marau: | |
| Urunga tuihono: | https://doi.org/10.1515/auom-2015-0036 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|