SOME NEW MEAN GRAPHS

S. K. Vaidya and K. K. Kanani

Received October 10, 2009

References:

[1] J. A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin. 16 (2009), #DS6. [2] J. Gross and J. Yellen, Graph Theory and its Applications, CRC Press, 1999. [3] Y. S. Ho, S. M. Lee and S. C. Shee, Cordial labellings of unicyclic graphs and generalized Petersen graphs, Congr. Numer. 68 (1989), 109-122. [4] G. Sethuraman and P. Selvaraju, Gracefulness of arbitrary supersubdivisions of graphs, Indian J. Pure. Appl. Math. 32 (2001), 1059-1064. [5] S. Somasundaram and R. Ponraj, Some results on mean graphs, Pure Appl. Math. Sci. 58 (2003), 29-35. [6] S. Somasundaram and R. Ponraj, Non-existence of mean labeling for a wheel, Bull. Pure Appl. Sci. Sect. E Math. Stat. 22 (2003), 103-111. [7] S. Somasundaram and R. Ponraj, On mean graphs of order J. Decision Math. Sci. 9 (2004), 48-58. [8] S. K. Vaidya, K. K. Kanani, P. L. Vihol and N. A. Dani, Some cordial graphs in the context of barycentric subdivision, Int. J. Contemp. Math. Sci. 4 (2009), 1479-1492. [9] S. K. Vaidya, Sweta Srivastav, G. V. Ghodasara and V. J. Kaneria, Cordial labeling for cycle with one chord and its related graphs, Indian J. Math. Math. Sci. 4 (2008), 145-156.

Keywords and phrases: mean labeling, mean graph, arbitrary supersubdivision.