Results 21 to 30 of about 407,230 (195)

Odd Harmonious Labeling of Lotus Flower Graphs

Cauchy
The purpose of the research is to obtain the construction of a new graph class definition and the new graph class satisfies the properties of odd harmonious labeling. The research method consists of a preliminary stage, namely the stage of finding open problems, the stage of analyzing data for the formation of definitions and theorems, the stage of ...
Muhammad Ridlo Yuwono, Tasari Tasari, Fery Firmansah   +2 more
exaly   +2 more sources

Double Quadrilateral Snakes on k-Odd Sequential Harmonious Labeling of Graphs

Malaya Journal of Matematik, 2015
The objective of this paper is to investigate some $k$-odd sequential harmonious labeling of graphs. In particular, we show that $k$-odd sequential harmonious labeling of double quadrilateral snakes $\left(2 Q_x\right.$-snakes) for each $x \geq 1$. We also prove that, $2 m Q_x$-snakes are $k$-odd sequential harmonious labeling of graphs for each $m, x \
null A. Manonmani, null R. Savithiri
exaly   +2 more sources

Odd Harmonious Labeling on Prism Snake Graphs and Generalized Prism Chain Snake Graphs

Journal of Physics: Conference Series
Abstract Graph labeling is the process of assigning elements from a specific set to the vertices, the edges, or both in a graph. Let G be a graph with vertex set V ( G ), edge set
Faizatul Arif Winarti, Desi Rahmadani
openaire   +2 more sources

Orthogonal labeling [PDF]

Indonesian Journal of Combinatorics, 2016
Let ∆G be the maximum degree of a simple connected graph G(V,E). An injective mapping P : V → R∆G is said to be an orthogonal labeling of G if uv,uw ∈ E implying (P(v) − P(u)) · (P(w) − P(u)) = 0, where · is the usual dot product defined in Euclidean ...
Bernard Immanuel, Kiki A. Sugeng
doaj   +2 more sources

Odd harmonious labeling of two graphs containing star [PDF]

AIP Conference Proceedings, 2021
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, Ikhsanul Halikin, Kristiana Wijaya   +2 more
openaire   +1 more source

The odd harmonious labeling of matting graph

Journal of Physics: Conference Series, 2021
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

Odd Fibonacci Stolarsky-3 Mean Labeling of Some Special Graphs [PDF]

, 2022
Let G be a graph with p vertices and q edges and an injective function  where each  is a odd Fibonacci number and the induced edge labeling  are defined byand all these edge labeling are distinct is called Odd Fibonacci Stolarsky-3 Mean Labeling. A graph
Sandhya, S.S, Sree Vidya, M
core   +1 more source

APPLICATION OF ODD HARMONIOUS LABELLING OF GRAPHS

, 2022
The labelling of discrete structures is an attractive research topic due to its vast range of applications. The current research is looking on strange harmonious labelling. If there exists an onto ff:V(G)→{0,1,2,,2q−1} such that the induced function 𝑓∗:E(G) →{1,3, ,2q−1}defined by f (uv) = f(u) + f(v) is a bijection, the graph G is said to be odd ...
A.Bhavya, K.Selvaraj
openaire   +2 more sources

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

The odd harmonious labelling of nhair-kC ₄-snake graph

Journal of Physics: Conference Series, 2021
Abstract Let G(p,q) be graph that consists of p = |V| vertices and q = |E| edges, where is the set of vertices and E is the set of edges of G. A graph G(p,q) is odd harmonious if there exist an injective function f: V → {0, 1, 2, …, 2q − 1} that induced a bijective function f ∗:E → {1, 3, 5, …, 2q − 1} defined by f
K Mumtaz, D R Silaban
openaire   +2 more sources