Journal article Open Access

Even-odd Harmonious Labeling of Some Graphs

Dhvanik H. Zala; Narendra T. Chotaliya; Mehul A. Chaurasiya

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:contributor>Blue Eyes Intelligence Engineering and Sciences Publication</dc:contributor>
  <dc:creator>Dhvanik H. Zala</dc:creator>
  <dc:creator>Narendra T. Chotaliya</dc:creator>
  <dc:creator>Mehul A. Chaurasiya</dc:creator>
  <dc:description>Let G = be a graph, with and. An injective mapping is called an even-odd harmonious labeling of the graph G, if an induced edge mapping such that (i) is bijective mapping (ii) The graph acquired from this labeling is called even-odd harmonious graph. In this paper, we discovered some interesting results like H-graph, comb graph, bistar graph and graph for even-odd harmonious labeling.</dc:description>
  <dc:source>International Journal of Innovative Technology and Exploring Engineering (IJITEE) 10(4) 149-151</dc:source>
  <dc:subject>Comb graph, Even-odd harmonious labeling, H-graph, Injective mapping</dc:subject>
  <dc:subject>Retrieval Number</dc:subject>
  <dc:title>Even-odd Harmonious Labeling of Some Graphs</dc:title>
Views 31
Downloads 23
Data volume 9.4 MB
Unique views 24
Unique downloads 22


Cite as