http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Bounds for domination parameters in circulant graphs
T. Tamizh Chelvam,Sivagnanam Mutharasu 장전수학회 2012 Advanced Studies in Contemporary Mathematics Vol.22 No.4
A circulant graph is a Cayley graph constructed out of a finite cyclic group Γ and a generating set A of Γ. Sharp upper bounds are obtained for the dom-ination number, the total domination number and the connected domination number of circulant graphs and exact values for some of the parameters are determined in certain cases. Further, efficient dominating sets of some classes of circulant graphs are also obtained.