CFP last date
20 May 2025
Reseach Article

Non Split Geo Chromatic Number of Certain Classes of Graphs

by Chitra Ramaprakash, Joseph Paul R.
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 186 - Number 78
Year of Publication: 2025
Authors: Chitra Ramaprakash, Joseph Paul R.
10.5120/ijca2025924686

Chitra Ramaprakash, Joseph Paul R. . Non Split Geo Chromatic Number of Certain Classes of Graphs. International Journal of Computer Applications. 186, 78 ( Apr 2025), 37-40. DOI=10.5120/ijca2025924686

@article{ 10.5120/ijca2025924686,
author = { Chitra Ramaprakash, Joseph Paul R. },
title = { Non Split Geo Chromatic Number of Certain Classes of Graphs },
journal = { International Journal of Computer Applications },
issue_date = { Apr 2025 },
volume = { 186 },
number = { 78 },
month = { Apr },
year = { 2025 },
issn = { 0975-8887 },
pages = { 37-40 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume186/number78/non-split-geo-chromatic-number-of-certain-classes-of-graphs/ },
doi = { 10.5120/ijca2025924686 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2025-04-26T02:19:17.168507+05:30
%A Chitra Ramaprakash
%A Joseph Paul R.
%T Non Split Geo Chromatic Number of Certain Classes of Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 186
%N 78
%P 37-40
%D 2025
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, a new concept, Non – Split Geo chromatic number, which is a combination of non split geodetic set and chromatic set and is denoted by gcns(G) is introduced. Here its verified under what conditions gcns(G) = gns(G) for various classes of graphs and if they are equal, greater or lesser by comparing them to another graph concept viz., vertex covering number or edge covering number. We also determine few bounds with respect to and α_0 (G) andβ(G).

References
  1. . Beulah, S. S.,& Robinson Chellathurai, S. (2018), Geo chromatic number of a graph. International Journal of Scientific Research in Mathematical and Statistical Sciences, 5, 259-264.
  2. . Bondy, J. Á.,& Murthy, U. S. R., (1976), Graph theory with application. Macmillon London and Elsevier, Newyork.
  3. . Buckley, F.,& Harary, F., (1990), Distance in Graphs. Addition – Wesley, Red – wood city, CA,
  4. . Buckley, F., Harary, F.,& Quintas, L. V., (1988), Extremal results on the geodetic number of a graph. Scientia A2, 17-26.
  5. Chartrand, G., and Zhang,P., (1999) , The forcing geodetic number of a graph, Discuss.Math. Graph Theory 19 ,45–58.
  6. Chartrand, G., Harary, F., & Zhang.,P, (2000 ) , "Geodetic Sets in Graphs", Discussiones Mathematicae Graph Theory 20 129–138.
  7. Chartrand, G., and Zhang, P., (2000) , The geodetic number of an oriented graph, European J. Combin. 21 ,181–189.
  8. Chartrand, G., Harary, F., and Zhang, P., (2002) On the geodetic number of a graph, Networks, an International Journal , Vol. 39, Issue 1, January.
  9. D B West, (2015) "Introduction to graph theory". Pearson Publishing.
  10. Harary, F., (1969), Graph Theory (Addison-Wesley, Reading, MA).
  11. Mulder, H M., (1980), The Interval Function of a Graph (Mathematisch Centrum, Amsterdam,
  12. Nebesk´y, L., (1994) , A characterization of the interval function of a connected graph, Czech. Math. J. 44 (119) ,173–178.
  13. Nebesk´y,L., (1998) ,Characterizing of the interval function of a connected graph, Math. Bohem. 123 137–144.
  14. Joseph Paul, R., and Uma, K.P., (2022), “A Study on Geo Chromatic Number for Operation of Graphs”, Journal of the Oriental Institute, M.S. University of Baroda, Vol.71, Issue 04, No. 11, pp. 13 – 19, Oct – Dec.
  15. . Tejaswini K M, Venkanagouda M Goudar, (2016), “Nonsplit Geodetic Number of a Graph”, International J.Math. Combin. Vol.2,109-120.
Index Terms

Computer Science
Information Sciences

Keywords

Distance chromatic geo chromatic non split vertex – cover edge- cover geodetic set geodetic number corona cartesian products