Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Odd Harmonious Labeling on Edge Amalgamation from Double Quadrilateral Graphs

View through CrossRef
A graph that has odd harmonious labeling properties is called an odd harmonious graph. The purpose of this research is to obtain a new class graphs construction which is a family of odd harmonious graphs. The research method used consisted of several stages, namely research preparation, research investigation and verifivation of research results. The results of this study, we will give a line amalgamation construction of n double quadrilateral graphs DQ, denoted by *DQ(n) with n>= 1 and graph obtained by connecting between two graphs *DQ(n) with line graph L2, denoted by *(DQ(n),L2,DQ(n)). It has  further been proven that *DQ(n) and *(DQ(n),L2,DQ(n)) have odd harmonious labeling properties, such that all of them are odd harmonious graphs.
Raden Intan State Islamic University of Lampung
Title: Odd Harmonious Labeling on Edge Amalgamation from Double Quadrilateral Graphs
Description:
A graph that has odd harmonious labeling properties is called an odd harmonious graph.
The purpose of this research is to obtain a new class graphs construction which is a family of odd harmonious graphs.
The research method used consisted of several stages, namely research preparation, research investigation and verifivation of research results.
The results of this study, we will give a line amalgamation construction of n double quadrilateral graphs DQ, denoted by *DQ(n) with n>= 1 and graph obtained by connecting between two graphs *DQ(n) with line graph L2, denoted by *(DQ(n),L2,DQ(n)).
It has  further been proven that *DQ(n) and *(DQ(n),L2,DQ(n)) have odd harmonious labeling properties, such that all of them are odd harmonious graphs.

Related Results

Pelabelan Harmonis Ganjil pada Graf Bunga Double Quadrilateral
Pelabelan Harmonis Ganjil pada Graf Bunga Double Quadrilateral
Graf harmonis ganjil adalah graf yang memenuhi sifat-sifat pelabelan harmonis ganjil. Tujuan dari penelitian ini adalah mendapatkan kelas graf baru yang merupakan graf harmonis gan...
Odd Harmonious Labeling of the Zinnia Flower Graphs
Odd Harmonious Labeling of the Zinnia Flower Graphs
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 an...
Product of digraphs, (super) edge-magic valences and related problems
Product of digraphs, (super) edge-magic valences and related problems
Discrete Mathematics, and in particular Graph Theory, has gained a lot of popularity during the last 7 decades. Among the many branches in Graph Theory, graph labelings has experim...
Fibonacci Prime Labelling on the Class of Flower Graphs
Fibonacci Prime Labelling on the Class of Flower Graphs
Graph labeling is one of the significant topics in graph theory. One of its interesting variants is Fibonacci prime labeling, a special type of labeling that assigns Fibonacci numb...
Magic graphs
Magic graphs
DE LA TESIS<br/>Si un graf G admet un etiquetament super edge magic, aleshores G es diu que és un graf super edge màgic. La tesis està principalment enfocada a l'estudi del c...
k-super cube root cube mean labeling of graphs
k-super cube root cube mean labeling of graphs
Consider a graph G with |V (G)| = p and |E(G)| = q and let f : V (G) → {k, k + 1, k + 2, . . . p + q + k − 1}} be an injective function. The induced edge labeling f ∗ for a vertex ...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...

Back to Top