Results 21 to 30 of about 427 (193)
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 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 +2 more
openaire +1 more source
A new labeling construction from the -product [PDF]
, 2017 The ¿h-product that is referred in the title was introduced in 2008 as a generalization of the Kronecker product of digraphs. Many relations among labelings have been obtained since then, always using as a second factor a family of super edge-magic ...
López Masip, Susana Clara +2 more
core +4 more sources
Harmonious labeling on prisms graph
Journal of Physics: Conference Series, 2019 Abstract In this paper, we show that C 2a+1 × Pn and ( C
N Hinding, W Husain, J Massalesse
openaire +1 more source
Odd harmonious labeling of grid graphs
Proyecciones (Antofagasta), 2019 A graph G(p, q) is said to be odd harmonious if there exists an injection 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. In this paper we prove that path union of t copies of Pm×Pn, path union of t different copies of Pmᵢ×Pnᵢ where 1 ≤ i ≤ t ...
P. Jeyanthi, S. Philo, Maged Z. Youssef
openaire +4 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 +2 more
openaire +1 more source
, 2020 A graceful labeling of a graph $G$ with $m$ edges consists of labeling the vertices of $G$ with distinct integers from $0$ to $m$ such that, when each edge is assigned as induced label the absolute difference of the labels of its endpoints, all induced ...
Dantas, Simone +2 more
core +2 more sources
Vertex Graceful Labeling-Some Path Related Graphs [PDF]
, 2013 Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P. +2 more
core +1 more source
Odd Harmonious Labeling of the Zinnia Flower Graphs
JURNAL ILMIAH SAINS, 2023 An odd harmonious graph is a graph that satisfies the odd harmonious labeling properties. In this study, a new graph class construction is presented, namely zinnia flower graphs and variations of the zinnia flower graphs. The research method used is qualitative and includes several phases, namely data collection, data processing and analysis, and ...
Firmansah, Fery +2 more
openaire +2 more sources
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 +1 more source