Bounds for domination parameters in circulant graphs
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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.
Abstract
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.
참고문헌 (11)
- I.J. Dejter, "Efficient dominating sets in Cayley graphs", Disc. Appl. Math, 129, pp.319~328 (2003)
- T.W. Haynes, "Fundamentals of Domination in Graphs" (2000), Marcel Dekker
- Jia Huang, "The bondage numbers and efficient dominations of vertex-transitive graphs", Disc. Math, 308, pp.571~582 (2008)
- S. Lakshmivarahan, "Rings, torus and hypercubes architectures", algorithms for parallel computing, 1999, pp.25, 1877~1906
- J. Lee, "Independent perfect domination sets in Cayley graphs", J. Graph Theory, 37(4), pp.231~219 (2001)
- N. Obradovi´c, "Efficient domination in circulant graphs with two chord lengths", Information Processing Letters, 102, pp.253~258 (2007)
- T. Tamizh Chelvam, "Dominating sets in Cayley Graphs", Tamkang J. Math, 37(4), pp.341~345 (2007)
- T. Tamizh Chelvam, "Independent domination number of Cayley graphs on Zn", J. Combin. Math. Combin. Comput, 69, pp.251~255 (2009)
- Tamizh Chelvam, "Total and Connected Domination Numbers of Cayley Graphs on Zn", Advanced Studies in Contemporary Mathematics, 20(1), pp.57~61 (2010), 장전수학회
- T. Tamizh Chelvam, "Efficient open domination in Cayley graphs", Appl. Math. Lett, 25, pp.1560~15644 (2012)
- T. Tamizh Chelvam, "Subgroups as efficient dominating sets in Cayley graphs", To appear in Discrete Appl. Math (2012)