| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4646500 | AKCE International Journal of Graphs and Combinatorics | 2015 | 7 Pages |
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 GG with connected domination number, γc(G)=2,3γc(G)=2,3 and characterize such graphs. Also, we characterize the k−γk−γ-vertex (edge) critical graphs and k−γck−γc-vertex (edge) critical graphs for k=2,3k=2,3 where γγ denotes the domination number of GG. We also discuss the vertex criticality in grids.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
M.R. Chithra, A. Vijayakumar,