Equitable eccentric domination in graphs
In this paper, we define equitable eccentric domination in graphs. An eccentric dominating set S ⊆ V (G) of a graph G(V, E) is called an equitable eccentric dominating set if for every v ∈ V − S there exist at least one vertex u ∈ V such that |d(v) − d(u)| ≤ 1 where vu ∈ E(G). We find equitable ecce...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Accademia Piceno Aprutina dei Velati
2023-06-01
|
| Edice: | Ratio Mathematica |
| Témata: | |
| On-line přístup: | http://eiris.it/ojs/index.php/ratiomathematica/article/view/802 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|