Results 1 to 10 of about 201 (165)
Properly even harmonious labelings of complete tripartite graph K1,m,n and union of two coconut tree graphs [PDF]
Let G be a finite graph, without loops nor multiple edges, having q edges. A function f is called properly even harmonious labeling on G if f is an injection from V (G) to {0,1, 2, …,2q −1} and the induced function f* from E(H) to {0, 2, 4, …, 2q - 2}, with f*(xy) = (f(x) + f(y)) (mod 2q), is a bijective.
Yuliana Ulfa, null Purwanto
openaire +3 more sources
A PROPERLY EVEN HARMONIOUS LABELING OF SOME WHEEL GRAPH W_n FOR n IS EVEN [PDF]
A properly even harmonious labeling of a graph G with q edges is an injective mapping f from the vertices of graph G to the integers from 0 to 2q-1 such that induces a bijective mapping f* from the edges of G to {0,2,...,2q-2} defined by f*(v_iv_j)=(f(v_i)+f(v_j))(mod2q).
Fakhrun Nisa +2 more
openaire +4 more sources
Properly even harmonious labelings of disconnected graphs
AbstractA 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, exactly one label may be used on two vertices.
Joseph A. Gallian, Danielle Stewart
openaire +4 more sources
Joseph A. Gallian, Danielle Stewart
openaire +4 more sources
Properly even harmonious labeling of a union of stars
Summary: A function \(f\) is defined as an even harmonious labeling on a graph \(G\) with \(q\) edges if \(f : V(G) \rightarrow \{0, 1, \dots, 2q\}\) is an injection and the induced function \(f^* : E(G) \rightarrow \{0, 2, \dots, 2(q-1)\}\) defined by \(f^*(uv)=f(u)+f(v) \pmod{2q}\) is bijective.
openaire +2 more sources
The false myth of "iodine allergy" also in nuclear medicine. [PDF]
Gómez-Perales JL, García-Mendoza A.
europepmc +1 more source
The Role of Artificial Intelligence in Orthodontics for Determining Skeletal Age Based on Cervical Vertebra Maturation Degree: A Comprehensive Review. [PDF]
Farzanegan P +4 more
europepmc +1 more source
PELABELAN HARMONIS GENAP SEJATI DARI BEBERAPA GRAF TERHUBUNG [PDF]
Pelabelan harmonis dari graf G dengan sisi merupakan suatu pemetaan injektif dari suatu titik yang ada pada graf G ke bilangan bulat modulo sehingga setiap sisi dilabeli () + () ( ) menghasilkan label sisi yang berbeda. Graf yang dilabeli menggunakan
Rahadjeng, Budi, Taqiyah, Diyanatut
core +2 more sources
THE HARMONIOUS, ODD HARMONIOUS, AND EVEN HARMONIOUS LABELING [PDF]
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 ...
Halikin, Ikhsanul +2 more
core +2 more sources
ℤ 2 × ℤ 2-Cordial Cycle-Free Hypergraphs [PDF]
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)+f(v)
Cichacz, S., Görlich, A., Tuza, Zsolt
core +1 more source

