DIVISOR CAYLEY GRAPHS: A STUDY ON MATCHING NUMBR
DOI:
https://doi.org/10.64751/Keywords:
Cayley graph, Divisor Cayley graph, Edge cover, Edge covering number, Matching number.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 ???? (????????, ????). In this paper we study the edge cover, edge covering number and matching number of the divisor Cayley graph ???? (????????, ????).
Downloads
Published
2025-05-13
Issue
Section
Articles
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
How to Cite
Dr. K. Sujatha. (2025). DIVISOR CAYLEY GRAPHS: A STUDY ON MATCHING NUMBR. International Journal of Data Science and IoT Management System, 4(2), 65–73. https://doi.org/10.64751/
