Even-Odd Harmonious Graphs
Journal: International Journal of Mathematics and Soft Computing (Vol.5, No. 1)Publication Date: 2015.01.01
Authors : N Adalin Beatress; P. B Sarasija;
Page : 23-29
Keywords : Harmonious labeling; bistar; complete bipartite graph;
Abstract
A graph G(V, E) with n vertices and m edges is said to be even-odd harmonious if there exists an injection f : V(G) →{ 1, 3, 5,…, 2n-1} such that the induced mapping f *:E(G) → {0,2,4,…,2(m-1)} defined by f*(uv) = [f(u) + f(v)] (mod 2m) is a bijection. The function f is called even-odd harmonious labeling of G. In this paper, we prove that the bistar graph Bm,n, cycle with one pendent edge, crown graph, the graph K1,m,n. the prism graph C3Yn and the graph nP2 are even-odd harmonious graphs.
Other Latest Articles
- The Effect of Erythropoietin on Ovarian Epithelium Karyorrhexis during Ischemia Reperfusion Injury in Rats
- Energy And Its Bounds For Generalised Star Graphs
- Wiener Index and Some Hamiltonian Properties of Graphs
- On Soft πgb-Closed Sets in Soft Topological Spaces
- Perishable inventory system with (s, Q) policy in supply chain
Last modified: 2017-08-30 19:20:27