论文标题
连接的功率支配产品图数
Connected power domination number of product graphs
论文作者
论文摘要
在本文中，我们考虑了三种标准图产品的连接功率支配数（$γ_{P，C} $）。 $γ_{p，c}（g \ circ h）$的确切值是为任何两个非平凡图$ g $和$ h的$。$进一步，在两个图形$ g $和$ h的连接功率支配数量的连接功率统治数量上，$ g $和$h。$的紧密上限被证明是cartesian cartesian的确切值的确切值。最后，讨论了图的张量产品的连接功率支配数。
In this paper, we consider the connected power domination number ($γ_{P, c}$) of three standard graph products. The exact value for $γ_{P, c}(G\circ H)$ is obtained for any two non-trivial graphs $G$ and $H.$ Further, tight upper bounds are proved for the connected power domination number of the Cartesian product of two graphs $G$ and $H.$ Consequently, the exact value of the connected power domination number of the Cartesian product of some standard graphs is determined. Finally, the connected power domination number of tensor product of graphs is discussed.
