Open Access
June 2013 Even vertex odd mean labeling of graphs
R. Vasuki, A. Nagarajan, S. Arockiaraj
Author Affiliations +
SUT J. Math. 49(2): 79-92 (June 2013). DOI: 10.55937/sut/1394108286

Abstract

In this paper we introduce a new type of labeling known as even vertex odd mean labeling. A graph G with p vertices and q edges is said to have an even vertex odd mean labeling if there exists an injective function f:V(G){0,2,4,,2q2,2q} such that the induced map f:E(G){1,3,5,,2q1} defined by f(uv)=f(u)+f(v)2 is a bijection. A graph that admits an even vertex odd mean labeling is called an even vertex odd mean graph. Here we investigate the even vertex odd mean behaviour of some standard graphs.

Citation

Download Citation

R. Vasuki. A. Nagarajan. S. Arockiaraj. "Even vertex odd mean labeling of graphs." SUT J. Math. 49 (2) 79 - 92, June 2013. https://doi.org/10.55937/sut/1394108286

Information

Received: 14 June 2012; Revised: 24 August 2013; Published: June 2013
First available in Project Euclid: 11 June 2022

Digital Object Identifier: 10.55937/sut/1394108286

Subjects:
Primary: 05C

Keywords: even vertex odd mean graph , even vertex odd mean labeling , labeling

Rights: Copyright © 2013 Tokyo University of Science

Vol.49 • No. 2 • June 2013
Back to Top