Further Results on Even Vertex Odd Mean Labeling of Graphs

Document Type : Primary Research paper


1 Department of Mathematics, Government Arts and Science College, Sivakasi- 626 124, Tamil Nadu, INDIA.

2 Department of Mathematics, Maharani’s Science College for Women, Mysore- 570 005, Karnataka, INDIA


A graph with ๐’‘ vertices and ๐’’ edges is said to have an even vertex odd mean labeling if there exists an injective function ๐’‡:๐‘ฝ(๐‘ฎ)→{๐ŸŽ,๐Ÿ,๐Ÿ’,…,๐Ÿ๐’’−๐Ÿ,๐Ÿ๐’’} such that the induced map ๐’‡∗:๐‘ฌ(๐‘ฎ)→{๐Ÿ,๐Ÿ‘,๐Ÿ“,…, ๐Ÿ๐’’−๐Ÿ} defined by ๐’‡∗(๐’–๐’—)=๐’‡(๐’–)+๐’‡(๐’—)๐Ÿ 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.