Results 11 to 20 of about 9,546 (165)
Odd harmonious labeling of two graphs containing star [PDF]
An odd harmonious labeling of a graph G is an injective function f:V(G)→{ 0,1,2,…,2| E(G) |−1 } such that the induced function f*:E(G)→{ 1,3,…,2| E(G) |−1 } defined by f*(xy)=f(x)+f(y) is a bijection. A graph that admits odd harmonious labeling is called an odd harmonious graph.
Diah Ayu Pujiwati +2 more
openaire +3 more sources
Odd Harmonious Labeling of Some New Families of Graphs
Abstract A graph G is said to be odd harmonious if there exists an injection f : V ( G ) → { 0 , 1 , 2 , … , 2 q − 1 } such that the induced function f ⁎ : E ( G ) → { 1 , 3 , … , 2 q − 1 } defined by f ⁎ ( u v ) = f ( u ) + f ( v ) ( m o d 2 q ) is a ...
P. Jeyanthi, S. Philo
exaly +4 more sources
Odd harmonious labeling on the union of flower graphs
Applications of graph labeling in the fields of communication network addressing, database management, secret sharing schemes, and cryptology. Graphs that satisfy the odd harmonious labeling property are called odd harmonious graphs.
Fery Firmansah +2 more
doaj +2 more sources
ODD HARMONIC LABELING ON Cm,n ⊵e C4 GRAPH
Graph is an ordered pair of a vertex and edge set that related with various theories, one of them called labeling. There are a lot of types of graph labeling, one of them is odd harmonious labeling. The odd harmonious labeling is an injective function f :
Demetriana Kolo +2 more
doaj +1 more source
Further Results on Odd Harmonious Graphs
In [1] Abdel-Aal has introduced the notions of m-shadow graphs and n-splitting graphs, for all m, n ≥ 1. In this paper, we prove that, the m-shadow graphs for paths and complete bipartite graphs are odd harmonious graphs for all m ≥ 1. Also, we prove the n-splitting graphs for paths, stars and symmetric product between paths and null graphs are odd ...
M. E. Abdel-Aal, M. A. Seoud
openaire +2 more sources
Harmonious Labelings Via Cosets and Subcosets
In [Abueida, A. and Roblee, K., More harmonious labelings of families of disjoint unions of an odd cycle and certain trees, J. Combin. Math. Combin. Comput., 115 (2020), 61-68] it is shown that the disjoint union of an odd cycle and certain paths is ...
Jared Painter +2 more
doaj +1 more source
Odd Harmonious Labeling of Pn ⊵ C4 and Pn ⊵ D2(C4)
A graph G with q edges is said to be odd harmonious if there exists an injection f:V(G) → ℤ2q so that the induced function f*:E(G)→ {1,3,...,2q-1} defined by f*(uv)=f(u)+f(v) is a bijection.Here we show that graphs constructed by edge comb product of ...
Sabrina Shena Sarasvati +2 more
doaj +1 more source
Even odd Harmonious Labeling of Some Graphs
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
Dhvanik H. Zala +2 more
openaire +1 more source
The odd harmonious labeling of matting graph
Abstract Let G(p, q) be a graph that consists of p vertices and q edges, where V is the set of vertices and E is the set of edges of G. A graph G(p, q) is odd harmonious if there exists an injective function f that labels the vertices of G by integer from 0 to 2q − 1 that induced a bijective function f ∗ defined by f
K Mumtaz, P John, D R Silaban
openaire +1 more source
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.
P. B. Sarasija, N. Adalin Beatress
openaire +1 more source

