Results 11 to 20 of about 274,981 (221)

On Harmonious Labeling of Corona Graphs [PDF]

Journal of Applied Mathematics, 2014
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) (mod q), the resulting edge labels are distinct.
Martin Bača, Maged Z. Youssef
doaj   +2 more sources

Odd harmonious labeling on the union of flower graphs

Desimal
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, Tasari Tasari, Joko Sungkono   +2 more
doaj   +2 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   +2 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, Danielle Stewart
doaj   +2 more sources

Relaxing the injectivity constraint on arithmetic and harmonious labelings

Electronic Journal of Graph Theory and Applications, 2022
Several of the most studied graph labelings are injective functions, this constraint precludes some graphs from admitting such labelings; a well-known example is given by the family of trees that cannot be harmoniously labeled.
Christian Barrientos, Maged Z Youssef
doaj   +1 more source

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

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 ...
Sabrina Shena Sarasvati, Ikhsanul Halikin, Kristiana Wijaya   +2 more
doaj   +1 more source

Odd Harmonious Labeling of Some Classes of Graphs

Cubo, 2020
A graph $G(p,q)$ is said to be odd harmonious if there exists an injection $f: V(G)\rightarrow\left\{0, 1, 2,\cdots,2q-1\right\}$ such that the induced function $f^{*}: E(G)\rightarrow\left\{1, 3,\cdots,2q-1\right\}$ defined by $f^{*}(uv) = f(u)+ f(v ...
P. Jeyanthi, S. Philo
doaj   +1 more source

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.
Shah, N.H., Vaidya, S.K.
core   +1 more source

Absolutely Harmonious Labeling of Graphs [PDF]

, 2011
In this paper, we obtain necessary conditions for a graph to be absolutely harmonious and study absolutely harmonious behavior of certain classes of ...
Lourdusamy, A., Seenivasan, M.
core   +1 more source