On graphs having domination number half their order
On graphs having domination number half their order
复制标题
DOI：
10.1007/bf01848079
复制
发表时间：
1985-12
影响因子：
0.8
通讯作者：
J. Fink;M. Jacobson;L. Kinch;J. Roberts
中科院分区：
文献类型：
--
作者：
J. Fink;M. Jacobson;L. Kinch;J. Roberts
本文给出了控制数为n的2n阶连通图的一个刻划，并利用这类图确定了一类无限图，其性质是任意两个图的乘积的控制数恰为控制数的乘积.
In this paper we present a characterization of connected graphs of order 2nwith domination numbern.Using this class of graphs, we determine an infinite class of graphs with the property that the domination number of the product of any two is precisely the product of the domination numbers.