|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 121 - Issue 17 |
| Published: July 2015 |
| Authors: Naveen Palanivel, Chithra.A.V |
10.5120/21629-4939
|
Naveen Palanivel, Chithra.A.V . Some Structural Properties of Unitary Addition Cayley Graphs. International Journal of Computer Applications. 121, 17 (July 2015), 1-5. DOI=10.5120/21629-4939
@article{ 10.5120/21629-4939,
author = { Naveen Palanivel,Chithra.A.V },
title = { Some Structural Properties of Unitary Addition Cayley Graphs },
journal = { International Journal of Computer Applications },
year = { 2015 },
volume = { 121 },
number = { 17 },
pages = { 1-5 },
doi = { 10.5120/21629-4939 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2015
%A Naveen Palanivel
%A Chithra.A.V
%T Some Structural Properties of Unitary Addition Cayley Graphs%T
%J International Journal of Computer Applications
%V 121
%N 17
%P 1-5
%R 10.5120/21629-4939
%I Foundation of Computer Science (FCS), NY, USA
For a positive integer n > 1, the unitary addition Cayley graph Gn is the graph whose vertex set is V (Gn) = Zn = f0; 1; 2; ; n ?? 1g and the edge set E(Gn) = fab j a; b 2 Zn; a + b 2 Ung where Un = fa 2 Zn j gcd(a; n) = 1g. For Gn the independence number, chromatic number, edge chromatic number, diameter, vertex connectivity, edge connectivity and perfectness are determined.