Computation of even-odd harmonious labeling of graphs obtained by graph operations

Kalaimathi, M.; Balamurugan, B. J.

doi:10.1063/1.5135205

Cited by 2 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Subsequently in the year 2015, Adalin Beatress and Sarasija in [2] introduced the even-odd harmonious graphs. Following this in the year 2019, we have proved that the graphs which are obtained through certain graph operations admit the even-odd harmonious labeling in the paper [6]. In this paper, we prove further the existence of even-odd harmonious labeling to certain family of acyclic graphs.…”

mentioning

confidence: 65%

Computation of Even-Odd Harmonious Labeling of Certain Family of Acyclic Graphs

Kalaimathi¹,

Balamurugan²

2019

IJEAT

View full text Add to dashboard Cite

Let G V E  ,  be a graph with p number of vertices and q number of edges. An injective function f V p : 1,3,5, ,2 1      is called an even-odd harmonious labeling of the graph G if there exists an induced edge function : 0,2, ,2 1       * f E q such that i) * f is bijective function ii)           2  * f e uv f u f v mod q The graph obtained from this labeling is called even-odd harmonious graph.

show abstract

mentioning

confidence: 65%

Computation of Even-Odd Harmonious Labeling of Certain Family of Acyclic Graphs

Kalaimathi¹,

Balamurugan²

2019

IJEAT

View full text Add to dashboard Cite

show abstract

“…Sarasija et al [11] introduced odd and even harmonious graphs respectively in the years 2009 and 2011 and in the later years even-odd harmonious labeling of a graph was introduced by Adalin Beatress and Sarasija [2]. Subsequently, in the year 2019, we have proved in [6] the existence of the even-odd harmonious labeling of certain graphs which are obtained through certain graph operations. Further in the same year in [7], we also shown the existence of this labeling to certain family of acyclic graphs.…”

Section: Introductionmentioning

confidence: 99%

Even-Odd Harmonious Labeling of Certain Family of Cyclic Graphs

Kalaimathi*,

Balamurugan

2020

IJITEE

View full text Add to dashboard Cite

An even-odd harmonious labeling of a graph G with p vertices and q edges is a process of assigning odd numbers 1,3,5,...,2 1 q  to the vertices through a 1-1 computing function f and even numbers 0,2,4,...,2( 1) p  to the edges through a bijective computing function * f with the condition that * f e uv f u f v q ( ) ( ( ) ( ))(mod2 )    where u and v are the vertices of G . This type of labelled graph is called as even-odd harmonious graph.

show abstract

Computation of even-odd harmonious labeling of graphs obtained by graph operations

Cited by 2 publications

References 5 publications

Computation of Even-Odd Harmonious Labeling of Certain Family of Acyclic Graphs

Computation of Even-Odd Harmonious Labeling of Certain Family of Acyclic Graphs

Even-Odd Harmonious Labeling of Certain Family of Cyclic Graphs

Contact Info

Product

Resources

About