Affiliation:
1. Department of Mathematics, St. Xavier’s College, 30 Park Street, Kolkata-700016, India
Abstract
This paper introduces a new domination parameter called coefficient of domination of a graph, which measures the maximum possible efficiency of domination for the given graph. It is evaluated for various classes of graphs and different bounds are proposed. Finally, Nordhaus–Gaddum type inequalities are established for coefficient of domination of a graph and its complement.
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Connected domination value in graphs;Electronic Journal of Graph Theory and Applications;2021-04-15
2. Partial Domination in Graphs;Iranian Journal of Science and Technology, Transactions A: Science;2018-07-30
3. On Practical Construction of Quality Fault-Tolerant Virtual Backbone in Homogeneous Wireless Networks;IEEE/ACM Transactions on Networking;2018-02