CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Some Structural Properties of Unitary Addition Cayley Graphs

by Naveen Palanivel, Chithra.a.v
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 121 - Number 17
Year of Publication: 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 },
issue_date = { July 2015 },
volume = { 121 },
number = { 17 },
month = { July },
year = { 2015 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume121/number17/21629-4939/ },
doi = { 10.5120/21629-4939 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:08:38.910382+05:30
%A Naveen Palanivel
%A Chithra.a.v
%T Some Structural Properties of Unitary Addition Cayley Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 121
%N 17
%P 1-5
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. Norman Biggs. Algebraic graph theory. Cambridge University Press, 1993.
  2. Megan Boggess, Tiffany Jackson-Henderson, Jime'nez, and Rachel Karpman. The structure of unitary cayley graphs. SUMSRI Journal, 2008.
  3. G. Chartrand and F. Harary. Graphs with prescribed connectivities. Symp. on Graph Theory Tihany, Acad. Sci. Hung. , pages 61–63, 1967.
  4. Maria Chudnovsky, Neil Robertson, Paul Seymour, and Robin Thomas. The strong perfect graph theorem. Annals of Mathematics, pages 51–229, 2006.
  5. Italo J Dejter and Reinaldo E Giudici. On unitary cayley graphs. J. Combin. Math. Combin. Comput, 18:121–124, 1995.
  6. Joseph Gallian. Contemporary abstract algebra. Cengage Learning, 2009.
  7. Chris Godsil and Gordon Royle. Algebraic graph theory, vol 207 of graduate texts in mathematics, 2001.
  8. Frank Harary. Graph Theory. Addison-Wesley, 1969.
  9. Walter Klotz and Torsten Sander. Some properties of unitary cayley graphs. The electronic journal of combinatorics, 14:R45, 2007.
  10. Ivan Niven, Herbert S Zuckerman, and Hugh L Montgomery. An introduction to the theory of numbers. JohnWiley & Sons, 2008.
  11. Jan Plesnik. Critical graphs of given diameter. Acta FRN Univ. Comen. Math, 30:71–93, 1975.
  12. Deepa Sinha, Pravin Garg, and Anjali Singh. Some properties of unitary addition cayley graphs. Notes on Number Theory and Discrete Mathematics, 17(3):49–59, 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Unitary Cayley Graph Unitary Addition Cayley Graph Chromatic Number Independence Number Connectivity Perfectness.

Powered by PhDFocusTM