| الوصف: |
In the present work we have discussed relative prime of split graph of the path graph when is odd or even. We have derived an algorithm which admits prime labeling to the split graph of the path graph .
{"references":["1.\tJ. A. Bondy and U. S. R. Murthy, \"Graph Theory and Applications\", (North-Holland), New York (1976) 2.\tD. M. Burton, \"Elementary Number Theory, second edition, W. M. C. Brown Company Publishers, 1980. 3.\tTout, A. N. Dabboucy and K. Howalla, \"Prime labeling of graphs\", Nat. Acad. Sci Letters, 11 (1982) 365-368. 4.\tT. O. Dretskyetal, \"On Vertex Prime Labeling of graphs in graph theory\", Combinatories and applications, Vol.1, J. Alari (Wiley. N. Y. 1991) 299-359. 5.\tH. C. Fu and K. C. Huany, \"On prime labeling Discrete Math\", 127, (1994) 181-186 6.\tJ. A. Gallian, \"A dynamic survey of Graph Labeling\", The Electronic Journal of Combinatorics, Vol 18, 2011. 7.\tJ. Gross and J. Yellen, \"Graph theory and its Applications\", CRC Press, Boca Raton, 1999. 8.\tS. M. Lee, L. Wui, and J. Yen, \"On the amalgamation of prime graphs Bull\", Malaysian Math. Soc (Second Series) 11, (1988) 59-67. 9.\tM. Sundaram, R. Ponraj and S. Somasundaram (2006), \"On prime labeling conjecture\", Arts Combinatoria 79 205-209. 10.\tP. Haxell, O. Pikhurko, and A. Taraz. Primality of trees. J. Comb. 2 (2011), 481–500."]} |
