Edge colorability of unitary endo-cayley graphs of cyclic groups
- 2 January 2018
- journal article
- research article
- Published by Taru Publications in Journal of Discrete Mathematical Sciences & Cryptography
- Vol. 21 (1), 191-198
- https://doi.org/10.1080/09720529.2017.1367469
Abstract
Let n be a positive integer greater than 1, ℤn the ring of integer modulo n, f an endomorphism on ℤn and Un the set of all units in ℤn. The unitary endo-Cayley digraph, denoted by endo-Cayf (ℤn, Un), is the digraph whose vertex set is ℤn and a vertex u is adjacent to v if v = f(u) + u ∈ Un for some u ∈ Un. We study about the edge coloring properties of undirected unitary endo-Cayley graphs, endo-Cayf (ℤn, Un). Their edge chromatic number are disclosed. We also determine what class they are of. Moreover, some basic properties involving edge coloring are investigated.Keywords
This publication has 5 references indexed in Scilit:
- Some Properties of Unitary Cayley GraphsThe Electronic Journal of Combinatorics, 2007
- On endo-Cayley digraphs: The hamiltonian propertyDiscrete Mathematics, 2005
- Chromatic Automorphisms of Consecutive DigraphsGraphs and Combinatorics, 2003
- Endo-circulant digraphs: connectivity and generalized cyclesDiscrete Mathematics, 1999
- Characterization of c-circulant digraphs of degree two which are circulantDiscrete Mathematics, 1997