论文标题
中间图的连接和外部连接的统治数
Connected and outer-connected domination number of middle graphs
论文作者
论文摘要
在本文中，我们研究了中间图的连接支配数和外部连接的统治数的概念。实际上，我们根据图M（g）的顺序获得了此数字的紧密界限。我们还计算了某些图的外部连接统治数，例如恒星图，循环图，车轮图，完整图，完整的两部分图和图形上的某些操作，明确地。此外，对中间图的外部连接的统治数提出了一些Nordhaus-gaddum样关系。
In this paper, we study the notions of connected domination number and of outer-connected domination number for middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph M(G). We also compute the outer-connected domination number of some families of graphs such as star graphs, cycle graphs, wheel graphs, complete graphs, complete bipartite graphs and some operation on graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the outer-connected domination number of middle graphs.
