论文标题
中间图的统治数
Domination number of middle graphs
论文作者
论文摘要
在本文中，我们研究了中图的支配数。确实，我们根据图的顺序获得了此数字的紧密界限。我们还计算了一些图的统治数，例如恒星图，双启动图，路径图，周期图，车轮图，完整的图，完整的两部分图和友谊图，明确地。此外，在中间图的统治数量中提出了一些诺德豪斯 - 加德杜姆样关系。
In this paper, we study the domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph. We also compute the domination number of some families of graphs such as star graphs, double start graphs, path graphs, cycle graphs, wheel graphs, complete graphs, complete bipartite graphs and friendship graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the domination number of middle graphs.
