Characterization of graphs with equal domination and connected domination numbers

被引：4

作者：

Chen, XG

Sun, L

Xing, HM

机构：

[1] Beijing Inst Technol, Sch Sci, Dept Math, Beijing 100081, Peoples R China

[2] Shandong Univ Sci & Technol, Coll Informat Sci & Engn, Tai An 271019, Shandong Prov, Peoples R China

[3] Langfang Teacher Coll, Dept Math, Langfang 065000, Hebei, Peoples R China

来源：

DISCRETE MATHEMATICS | 2004年 / 289卷 / 1-3期

基金：

中国国家自然科学基金;

关键词：

domination number; connected domination number; block graph; cactus graph;

D O I：

10.1016/j.disc.2004.08.006

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Arumugam and Paulraj Joseph (Discrete Math 206 (1999) 45) have characterized trees, unicyclic graphs and cubic graphs with equal domination and connected domination numbers. In this paper, we extend their results and characterize the class of block graphs and cactus graphs for which the domination number is equal to the connected domination number. (C) 2004 Elsevier B.V. All rights reserved.

引用

页码：129 / 135

页数：7