Mean labelling of graphs obtained by identifying two graphs. (English) Zbl 1144.05328

Ponraj, R.; Somasundaram, S.

J. Discrete Math. Sci. Cryptography 11, No. 2, 239-252 (2008).

Summary: A graph \(G=(V,E)\) with \(p\) vertices and \(q\) edges is said to be a mean graph if it is possible to label the vertices \(x\in V\) with distinct elements \(f(x)\) from \(0,1,2,\dots,q\) in such a way that when each edge \(e=uv\) is labelled with \((f(u)+f(v))/2\) if \(f(u)+f(v)\) is even and \((f(u)+f(v)+1)/2\) if \(f(u)+f(v)\) is odd, then the resulting edge labels are distinct. \(f\) is called a mean labeling of \(G\). In this paper, we investigate the mean labeling of caterpillar, \(C_n^{(2)}\), dragon, arbitrary super subdivision of a path and some graphs which are obtained from cycles and stars.

MSC:

05C78

Graph labelling (graceful graphs, bandwidth, etc.)

Keywords:

mean graph; dragon; super subdivision of a graph; caterpillar

References:

[1]	Gallian J. A., The Electronic Journal of Combinatorics 6 (2007)
[2]	Harary F., Graph Theory (1969)
[3]	Sethuraman G., Indian J. Pure. Appl. Math. 32 pp 1059– (2001)
[4]	Somasundaram S., National Academy Science Letters 26 pp 210– (2003)
[5]	Somasundaram S., Bulletin of Pure and Applied Sciences (SecE, Maths & Statistics) 22 pp 103– (2003)
[6]	Somasundaram S., Pure and Applied Mathematka Sciences 58 pp 29– (2003)
[7]	Somasundaram S., Journal of Decision and Mathematical Sciences 9 (1) pp 48– (2004)