Results 1 to 10 of about 427 (193)
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 ...
Jared Painter +2 more
doaj +8 more sources
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, Danielle Stewart
doaj +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
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
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
ℤ2 × ℤ2-Cordial Cycle-Free Hypergraphs
Discussiones Mathematicae Graph Theory, 2021 Hovey introduced A-cordial labelings as a generalization of cordial and harmonious labelings [7]. If A is an Abelian group, then a labeling f : V (G) → A of the vertices of some graph G induces an edge labeling on G; the edge uv receives the label f(u) +
Cichacz Sylwia +2 more
doaj +1 more source
Radio Labelings of Lexicographic Product of Some Graphs
Journal of Mathematics, 2021 Labeling of graphs has defined many variations in the literature, e.g., graceful, harmonious, and radio labeling. Secrecy of data in data sciences and in information technology is very necessary as well as the accuracy of data transmission and different ...
Muhammad Shahbaz Aasi +3 more
doaj +1 more source
On Harmonious Labeling of Corona Graphs [PDF]
Journal of Applied Mathematics, 2014 A graphGwithqedges is said to be harmonious, if there is an injectionffrom the vertices ofGto the group of integers moduloqsuch that when each edgexyis assigned the labelf(x)+f(y)(modq), the resulting edge labels are distinct. In this paper, we study the existence of harmonious labeling for the corona graphs of a cycle and a graphGand for the corona ...
Martin Bača, Maged Z. Youssef
openaire +3 more sources
Indonesian Journal of Combinatorics, 2020 In a quite general sense, additive vertex labelings are those functions that assign nonnegative integers to the vertices of a graph and the weight of each edge is obtained by adding the labels of its end-vertices.
Christian Barrientos
doaj +1 more source
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 +3 more sources