Abstract
Abstract
In this paper, we introduce a new definition of domination number in graphs called restrained whole domination number and denoted byɣrwh(G). Some bounds and results for restrained whole domination number are established. Moreover, this number is computed to the complement of certain graphs. Finally, the Effective the deletion or addition an edge or the deletion of a vertex of the graph has this number is discussed.
Subject
General Physics and Astronomy
Reference16 articles.
1. Pitchfork domination in graphs;Al-Harere;Discrete Mathematics Algorithms and Applications,2020
2. On binary operation graphs;Al-Harere;Boletim da SociedadeParanaense de Matematica,2020
3. Domination Polynomial of the Composition of Complete Graph and Star Graph;Alwan;J. Phys Conf Ser.,2020
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献