Independent Set of Divisor Cayley Graph
Year: 2025
Type: article
Abstract: Let š ā„1 be an integer and let š be the set of divisors of š other than š. Then the set šā = {š , š - š / š ā š } is a symmetric subset of the group (šš,ā), the additive abelian group of integers modulo š. The Cayley graph of (šš,ā) associated with the above symmetric subset šā is called the divisor Cayley graph and it is denoted by šŗ( šš, š·). That is, the graph G(Zn, D) is the graph whose vertex set is V = { 0,1,2,., nā1} and the edge set E is the set of all ordered pairs of vertices x, y such that either x ā y ļ S*, or , y ā x ļ S*. In this paper we study the independent set, independence number and chromatic number of the divisor Cayley graph šŗ( šš, š·).
Author: Dr. K. Sujatha
Language: English
Topic: Finite Group Theory Research
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7084400366
FWCI:
Cites:
Cited by:
Related to: