Unitary Cayley graphs whose Roman domination numbers are at most four
Let R be a finite commutative ring with nonzero identity. The unitary Cayley graph of R is the graph obtained by letting all the elements of R to be the vertices and defining distinct vertices x and y to be adjacent if and only if x - y is a unit element of R. In this paper, we characterize all unit...
Saved in:
Main Authors: | Chin, Angelina Yan Mui, Maimani, H. R., Pournaki, M. R., Sivagami, M., Tamizh Chelvam, T. |
---|---|
Format: | Article |
Published: |
Taylor & Francis Ltd
2022
|
Subjects: | |
Online Access: | http://eprints.um.edu.my/42977/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Dominating Sets and Domination Polynomials of Graphs
by: Alikhani, Saeid
Published: (2009) -
Whose is it anyway?
by: Abd Razak, Dzulkifli
Published: (2009) -
Entropic bounds for unitary testers and mutually unbiased unitary bases
by: Shamsul Shaari, Jesni, et al.
Published: (2020) -
Energy of Cayley graphs for alternating groups
by: A. Fadzil, A. F., et al.
Published: (2020) -
Spectrum of cayley graphs of dihedral groups and their energy
by: Sarmin, Nor Haniza, et al.
Published: (2018)