Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Independent Domination Number of Cayley Graphs on \(\mathbb{Z}_{n}\)

T. Tamizh Chelvam1, I. Rani1
1Department of Mathematics Manonmaniam Sundaranar University Tirunelveli 627 012, India.
  • Published: 31/05/2009

Abstract

A Cayley graph is a graph constructed out of a group \(\Gamma\) and its generating set \(A\). In this paper, we determine the independent domination number, perfect domination number, and independent dominating sets of \(Cay(\mathbb{Z}_n, A)\), for a specified generating set \(A\) of \(\mathbb{Z}_n\).

Keywords: Cayley graphs, dominating sets, independent domination number. 2000 Mathematics Subject Classification: 05C
Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
T. Tamizh Chelvam, I. Rani. Independent Domination Number of Cayley Graphs on \(\mathbb{Z}_{n}\)[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 069. 251-255. DOI: .