Results 11 to 20 of about 793,315 (170)

Odd harmonious labeling on the union of flower graphs

Desimal: Jurnal Matematika
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. The purposes of the research are to obtain the construction of the union of zinnia flower graphs, the union of double ...
Fery Firmansah, Tasari Tasari, Joko Sungkono   +2 more
core   +4 more sources

Even-Odd Prime Harmonious Graphs [PDF]

Pandian Journal of Mathematical Sciences, 2022
The paper considers finite and undirected simple connected graphs. Usually, graph labeling is an assignment of integers to the vertices or edges in the method. Naturally, Graphs arose in the study of Graham and Slaone Modular versions of additive based problems.
Dr R. S. Ramkumar
core   +3 more sources

THE HARMONIOUS, ODD HARMONIOUS, AND EVEN HARMONIOUS LABELING [PDF]

Barekeng, 2022
Suppose  is a simple and connected graph with  edges. A harmonious labeling on a graph  is  an injective function  so that there exists a bijective function  where  for each  An odd harmonious labeling on a graph ...
Lasim, Ahmad, Wijaya, Kristiana, Halikin, Ikhsanul   +2 more
core   +3 more sources

Even odd Harmonious Labeling of Some Graphs

International Journal of Innovative Technology and Exploring Engineering, 2021
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, Narendra T. Chotaliya, Mehul A. Chaurasiya   +2 more
openaire   +3 more sources

Odd Harmonious Labeling of Some Classes of Graphs [PDF]

Cubo (Temuco), 2020
This paper investigates strongly odd harmonious labeling of graphs and obtains some classes of graphs that are strongly odd harmonious.
P. Jeyanthi, S. Philo
openaire   +4 more sources

Harmonious Labelings Via Cosets and Subcosets [PDF]

Theory and Applications of Graphs, 2022
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 ...
Landers, Holleigh C, Painter, Jared L, Mattox, Walker M   +2 more
core   +3 more sources

Odd Harmonious Labeling of P_n ⊵ C₄ and  P_n ⊵ D₂(C₄)

Indonesian Journal of Combinatorics, 2021
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 ...
Kristiana Wijaya, Sabrina Shena Sarasvati, Ikhsanul Halikin   +2 more
core   +2 more sources

Odd Harmonious Labeling Of Some Graphs [PDF]

, 2012
The labeling of discrete structures is a potential area of research due to its wide range of applications. The present work is focused on one such labeling called odd harmonious labeling.
Vaidya, S.K., Shah, N.H.
openaire   +3 more sources

Further Results on Odd Harmonious Graphs

International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks, 2016
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   +4 more sources

Odd harmonious labeling of some cycle related graphs

Proyecciones (Antofagasta), 2017
A graph G(p, q) is said to be odd harmonious if there exists an in-jection f : V(G)→ {0,1, 2, ..., 2q — 1} such that the induced function f * : E(G) → {1, 3, ... 2q — 1} defined by f * (uv) = f (u) + f (v) is a bijection. A graph that admits odd harmonious labeling is called odd harmonious graph.
Jeyanthi, P., Philo, S.
openaire   +4 more sources