Domination Parameters of the Unitary Cayley Graph of /n
The unitary Cayley graph of /n, denoted Xn, is the graph with vertex set {0, . . ., n − 1} where vertices a and b are adjacent if and only if gcd(a − b, n) = 1. We answer a question of Defant and Iyer by constructing a family of infinitely many integers n such that γt(Xn) ≤ g(n) − 2, where γt deno...
Main Author: | Burcroff Amanda |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2023-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2352 |
Similar Items
-
On Laplacian spectrum of unitary Cayley graphs
by: Pirzada S., et al.
Published: (2021-12-01) -
Efficient Domination in Cayley Graphs of Generalized Dihedral Groups
by: Caliskan Cafer, et al.
Published: (2022-08-01) -
Domination in Cayley graphs: A survey
by: T. Tamizh Chelvam, et al.
Published: (2019-04-01) -
The Cayley Sum Graph of Ideals of a Lattice
by: Afkhami Mojgan, et al.
Published: (2020-12-01) -
On the metric dimension of Cayley graphs
by: Afsaneh Rezaei, et al.
Published: (2022-05-01)