Equitable fair domination in graphs
| Autor: | L. Muthusubramanian, D. Lakshmanaraj, P. Nataraj, R. Sundareswaran, V. Swaminathan |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | Discrete Mathematics, Algorithms and Applications. 13 |
| ISSN: | 1793-8317 1793-8309 |
| DOI: | 10.1142/s179383092150083x |
| Popis: | Graphs considered here are simple, finite and undirected. A graph is denoted by [Formula: see text] and it has vertex set [Formula: see text] and edge set [Formula: see text]. Inspired by two concepts, this paper comes into existence. One is the degree equitability in graphs conceived by Prof. E. Sampathkumar and the other is fair domination (that is, vertices outside the dominating set are dominated by equal number of vertices) [Y. Caro, A. Hansberg and M. Henning, Fair domination in graphs, Discrete Math. 312 (2012) 2905–2914], Equitable fair domination is studied here. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|