Open Access
January 2010 On super mean labeling of some graphs
P. Jeyanthi, D. Ramya, P. Thangavelu
Author Affiliations +
SUT J. Math. 46(1): 53-66 (January 2010). DOI: 10.55937/sut/1280430775

Abstract

Let G be a (p,q)-graph and : V(G){k,k+1,k+2,k+3,,p+q+k1} be an injection. For each edge e=uv, let f*(e)=f(u)+f(v)2. Then f is called a k-super mean labeling if f(V){f*(e):eE(G)}={k,k+1,k+2,,p+q+k1}. A graph that admits a k-super mean labeling is called k-super mean graph. In this paper, we present k-super mean labeling of C2n(n2) and super mean labeling of Double cycle C(m,n), Dumb bell graph D(m,n) and Quadrilateral snake Qn.

Citation

Download Citation

P. Jeyanthi. D. Ramya. P. Thangavelu. "On super mean labeling of some graphs." SUT J. Math. 46 (1) 53 - 66, January 2010. https://doi.org/10.55937/sut/1280430775

Information

Received: 23 July 2009; Revised: 24 May 2010; Published: January 2010
First available in Project Euclid: 11 June 2022

Digital Object Identifier: 10.55937/sut/1280430775

Subjects:
Primary: 05C78

Keywords: k-super mean graph , super mean graph , Super mean labeling

Rights: Copyright © 2010 Tokyo University of Science

Vol.46 • No. 1 • January 2010
Back to Top