본문 바로가기
KERD
논문KCI 등재

Total and Connected Domination Numbers of Cayley Graphs on Zn

1

조회

0

다운로드

1

인용

0

참고문헌

키워드

주제분류수학

초록

A Cayley graph is a graph constructed out of a group T and its gen-erating set A. In this paper, we attempt to nd the total and connected domination numbers of Cay(Zn,A), for some speci ed generating sets A of Zn.

Abstract

A Cayley graph is a graph constructed out of a group T and its gen-erating set A. In this paper, we attempt to nd the total and connected domination numbers of Cay(Zn,A), for some speci ed generating sets A of Zn.

참고문헌 (4)

  1. T. W. Haynes, "Fundamentals of Domination in Graphs" (1998), Marcel Dekker
  2. S. Lakshmivarahan, "Ring, torus, hypercube architectures algorithms for parallel computing", Parallel Computing, 25, pp.1877~1906 (1999)
  3. T. Tamizh Chelvam, "Dominating sets in Cayley graphs on Zn", Tamkang Journal of Mathematics, 37(4), pp.341~345 (2007)
  4. Tamizh Chelvam,T., "Independent domination number for Cayley graphs on Zn", The Journal of Combinatorial Mathematics and Combinatorial Computing, 69, pp.251~255 (2009)

관련 논문AI추천

이 간행물의 다른 논문 (13건)