Open Access
June 2011 Mean Labeling of Some Graphs
D. Ramya, P. Jeyanthi
Author Affiliations +
SUT J. Math. 47(2): 129-141 (June 2011). DOI: 10.55937/sut/1329739297


Let G be a (p,q) graph and f:V(G){0,1,2,3,,q} be an injection. For each edge e=uv, let f*(e)=f(u)+f(v)2 Then f is called a mean labeling if {f*(e):eE(G)}={1,2,3,,q}. A graph that admits a mean labeling is called a mean graph. In this paper, we prove TôCn,TõCn,T@Pn,T2Pn where T is a Tp-tree, are mean graphs.


Download Citation

D. Ramya. P. Jeyanthi. "Mean Labeling of Some Graphs." SUT J. Math. 47 (2) 129 - 141, June 2011.


Received: 28 January 2011; Revised: 11 November 2011; Published: June 2011
First available in Project Euclid: 11 June 2022

Digital Object Identifier: 10.55937/sut/1329739297

Primary: 05C78

Keywords: mean graph , Mean labeling , Tp-tree

Rights: Copyright © 2011 Tokyo University of Science

Vol.47 • No. 2 • June 2011
Back to Top