Results 21 to 30 of about 793,315 (170)
The Odd Harmonious Labeling on Variation of the Double Quadrilateral Windmill Graphs [PDF]
Jurnal ILMU DASAR, 2017 A Graphis calledif it hasvertices and edqes. The graphis said to be an odd harmonious if there exists an injectionsuch that induced mappingis a bijection and is said to be an odd harmonious labeling of. In this paper, we construct the odd harmonious labeling on variation of the double quadrilateral windmill graph with .
Firmansah, Fery, Fery Firmansah
openaire +4 more sources
Odd Harmonious Labeling on Prism Snake Graphs and Generalized Prism Chain Snake Graphs
Journal of Physics: Conference SeriesAbstract 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
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 HARMONIC LABELING ON Cm,n ⊵e C4 GRAPH
Jurnal Diferensial, 2023 Graph is an ordered pair of a vertex and edge set that related with various theories, one of them called labeling. There are a lot of types of graph labeling, one of them is odd harmonious labeling. The odd harmonious labeling is an injective function f :
Demetriana Kolo +2 more
doaj +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 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
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
International Journal of Mathematics and Soft Computing, 2015 A graph G(V, E) with n vertices and m edges is said to be even-odd harmonious if there exists an injection f : V(G) ?{ 1, 3, 5,…, 2n-1} such that the induced mapping f *:E(G) ? {0,2,4,…,2(m-1)} defined by f*(uv) = [f(u) + f(v)] (mod 2m) is a bijection. The function f is called even-odd harmonious labeling of G.
P. B. Sarasija, N. Adalin Beatress
openaire +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
The harmonious chromatic number of almost all trees [PDF]
, 1995 A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring.For any positive integer ...
Edwards, Keith
core +1 more source