1 |
A. Brandstadt, V. B. Le and J. P. Spinrad, Graph Classes: A Survey, Philadelphia, PA: SIAM, (1999).
|
2 |
A. Tout, A. N. Dabboucy, K. Howala, prime labeling of graphs, National Academy Science Letters, 11 (1982), 365-368.
|
3 |
D.M.Burton, Elementary Number Theory, Tata McGraw Hill, (1990).
|
4 |
J. Gallian, A dynamic survey of graph labeling, Electron. J. Comb., (2018), #DS6.
|
5 |
J. Gross and J. Yellen, Graph theory and its applications, CRC press, (1999).
|
6 |
S. Klee, H. Lehmann, A. Park, Prime labeling of families of trees with Gaussian integers, AKCE International Journal of Graphs and Combinatorics, 13 (2016), 165-176.
DOI
|
7 |
T. Deretsky, S. M. Lee and J. Mitchem, On vertex prime labelings of graphs, Graph Theory, Combinatorics and Applications 1, J. Alavi, G. Chartrand, O. Oellerman and A. Schwenk, eds., Proceedings 6th International Conference Theory and Applications of Graphs(Wiley, New York, 1991) 359-369.
|
8 |
S. -C. Shee and Y. -S. Ho, The cordiality of one-point union of n copies of a graph, Discrete Math., 117 (1993), 225-243.
DOI
|
9 |
A. Litersky, Graceful Kayak Paddles, M.S. Thesis, Duluth, MN: University of Minnesota Duluth, (2011).
|
10 |
H. Lehmann and A. Park. Prime labeling of small trees with Gaussian integers. Rose-Hulman Undergraduate Mathematics Journal, 17 (2016), no. 1, 72-97,
|