Equitable fair domination in graphs
V Swaminathan, R Sundareswaran… - Discrete Mathematics …, 2021 - World Scientific
V Swaminathan, R Sundareswaran, D Lakshmanaraj, P Nataraj, L Muthusubramanian
Discrete Mathematics, Algorithms and Applications, 2021•World ScientificGraphs considered here are simple, finite and undirected. A graph is denoted by G and it
has vertex set V (G) and edge set E (G). 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.
has vertex set V (G) and edge set E (G). 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.
Graphs considered here are simple, finite and undirected. A graph is denoted by and it has vertex set and edge set . 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.
World Scientific以上显示的是最相近的搜索结果。 查看全部搜索结果