期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2015
卷号：12
期号：1
页码：19-25
DOI：10.1016/j.akcej.2015.06.003
语种：English
出版社：Elsevier
摘要：Abstract A connected dominating set is an important notion and has many applications in routing and management of networks. Graph products have turned out to be a good model of interconnection networks. This motivated us to study the Cartesian product of graphs G with connected domination number, γ c ( G ) = 2 , 3 and characterize such graphs. Also, we characterize the k − γ -vertex (edge) critical graphs and k − γ c -vertex (edge) critical graphs for k = 2 , 3 where γ denotes the domination number of G . We also discuss the vertex criticality in grids.
