IJSTR

International Journal of Scientific & Technology Research

Home About Us Scope Editorial Board Blog/Latest News Contact Us
0.2
2019CiteScore
 
10th percentile
Powered by  Scopus
Scopus coverage:
Nov 2018 to May 2020

CALL FOR PAPERS
AUTHORS
DOWNLOADS
CONTACT

IJSTR >> Volume 8 - Issue 8, August 2019 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



Prime Coloring Of Some Graphs

[Full Text]

 

AUTHOR(S)

P.Murugarajan, R. Aruldoss

 

KEYWORDS

Prime graph, Vertex Coloring, Prime Coloring

 

ABSTRACT

In the recent era, the coloring of the graphs is arousing the attention of researchers. Among the mathematical models, coloring technique plays a vital role in a broad range of applications in real life problems and it solves several complexities of computer networks. Considering the above facts, in this paper, prime coloring and its chromatic number of some graphs are depicted and its results are validated with few theorems. Subject Classification Code: 05C78, 05C15

 

REFERENCES

[1]. Bondy.J.A and MurtyU.S.R, Graph Theory with Applications, London, Macmillan, (1976).(Book)
[2]. Galian .J.A, A Dynamic Survey of Graph Labeling, Electronic Journal of Combinatorics, 16, (2009), #DS6.
[3]. Lee.S.M, Wui J. Yeh.I, On the Amalgamation Of Prime Graphs, Bull.Malaysian.Math.Soc.(Second Series), 11 , 59-67 (1988).
[4]. Oleg Pikhurko, Trees Are Almost Prime DiscreteMathematicsElsevier307,1455-1462,(2007), https://doi.org/10.1016/j.disc.2005.11.083
[5]. Thomas Koshy, Elementary Number Theory with Applications, pp 103-115 Elsevier, 2005.(Book)
[6]. Samir K.Vaidya, Udayan M. Prajapati, Some New Results on Prime Graphs, Open Journal Of Discrete Mathematics,(2),99-104,2012.