Results 1 to 10 of about 240 (63)
Properly even harmonious labelings of disconnected graphs
AKCE International Journal of Graphs and Combinatorics, 2015 A graph G with q edges is said to be harmonious if there is an injection f from the vertices of G to the group of integers modulo q such that when each edge xy is assigned the label f(x)+f(y)(modq), the resulting edge labels are distinct. If G is a tree,
Joseph A Gallian
exaly +4 more sources
Even harmonious labelings of disjoint graphs with a small component
AKCE International Journal of Graphs and Combinatorics, 2015 A graph G with q edges is said to be harmonious if there is an injection f from the vertices of G to the group of integers modulo q such that when each edge xy is assigned the label f(x)+f(y)(modq), the resulting edge labels are distinct. If G is a tree,
Joseph A Gallian
exaly +4 more sources
THE HARMONIOUS, ODD HARMONIOUS, AND EVEN HARMONIOUS LABELING [PDF]
BAREKENG: Jurnal Ilmu Matematika dan Terapan, 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 is an injective function from to non-negative integer set less than so that there is a function where for every An even harmonious ...
Ahmad Lasim +2 more
openaire +4 more sources
Properly even harmonious labelings of complete tripartite graph K1,m,n and union of two coconut tree graphs [PDF]
AIP Conference Proceedings, 2021 Let G be a finite graph, without loops nor multiple edges, having q edges. A function f is called properly even harmonious labeling on G if f is an injection from V (G) to {0,1, 2, …,2q −1} and the induced function f* from E(H) to {0, 2, 4, …, 2q - 2}, with f*(xy) = (f(x) + f(y)) (mod 2q), is a bijective.
Yuliana Ulfa, null Purwanto
exaly +2 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 +2 more
exaly +4 more sources
A PROPERLY EVEN HARMONIOUS LABELING OF SOME WHEEL GRAPH W_n FOR n IS EVEN [PDF]
BAREKENG: Jurnal Ilmu Matematika dan TerapanA properly even harmonious labeling of a graph G with q edges is an injective mapping f from the vertices of graph G to the integers from 0 to 2q-1 such that induces a bijective mapping f* from the edges of G to {0,2,...,2q-2} defined by f*(v_iv_j)=(f(v_i)+f(v_j))(mod2q).
Fakhrun Nisa +2 more
openaire +4 more sources
Harmonious graphs from α-trees
Electronic Journal of Graph Theory and Applications, 2021 Two of the most studied graph labelings are the types of harmonious and graceful. A harmonious labeling of a graph of size m and order n, is an injective assignment of nonnegative integers smaller than m, such that the weights of the edges, which are ...
Christian Barrientos, Sarah Minion
doaj +1 more source
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 +2 more
openaire +2 more sources