Perfect connected-dominant graphs
Perfect connected-dominant graphs
复制标题
DOI：
10.7151/dmgt.1192
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
I. Zverovich
中科院分区：
文献类型：
--
作者：
I. Zverovich
如果d是一个主导集，并且连接了诱导的子图G（d），则D是连接的主体集合。如果∞（h）=∞c（h）对于G的每个连接的诱导子图H，则G被称为完美连接的占主导地位。 P5并引起C5周期。
If D is a dominating set and the induced subgraph G(D) is connected, then D is a connected dominating set. The minimum size of a connected dominating set in G is called connected domination number ∞c(G) of G. A graph G is called a perfect connected-dominant graph if ∞(H) = ∞c(H) for each connected induced subgraph H of G. We prove that a graph is a perfect connected-dominant graph if and only if it contains no induced path P5 and induced cycle C5.