Manuscript Number : IJSRST1841024
Odd Vertex Even Mean Labeling of H-Graph
Authors(2) :-R. Jayapriya, H.Haseena Begum
A graph with m vertices and n edges is said to have an odd vertex even mean labeling if there exist an injective function f:V(G)→{1,3,5…2s-1} such that the induced map f*:E(G)→{2,4,…2s-2,2s} define by f*(u?v?)= is a bijection. A graph that admits an odd vertex even mean labeling is called an odd vertex even mean graph. Here we study the odd vertex even mean behavior of H-graph.
R. Jayapriya
Odd Vertex Even Mean Labeling, Odd Vertex Even Mean Graph.
Publication Details
Published in :
Volume 4 | Issue 10 | September-October 2018 Article Preview
PG Student, Department of Mathematics, Dr.SNS Rajalakshmi College of Arts and Science (Autonomous), Coimbatore, Tamilnadu, India
H.Haseena Begum
Assistant professor, Department of Mathematics, Dr.SNS Rajalakshmi College of Arts and Science (Autonomous), Coimbatore, Tamilnadu, India
Date of Publication :
2018-09-30
License: This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) :
77-81
Manuscript Number :
IJSRST1841024
Publisher : Technoscience Academy
Journal URL :
http://ijsrst.com/IJSRST1841024