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
This paper deals with the total irregularity strength of complete bipartite graph where ...
A graph with n vertex and m edges is said to be cubic graceful labeling if its vertices are labeled ...
A graph labeling is an assignment of integers to the vertices or edges or both subject to certain co...
A graph that has odd harmonious labeling properties is called an odd harmonious graph. The purpose o...
Graph class which has the characteristic of odd harmonious labeling is called as odd harmonious grap...
Let G=(V(G), E(G)) be a connected graph with order |V(G)|=p and size |E(G)|=q. A graph G is said to ...
This paper deals with the totally irregular total labeling of the disjoin union of friendship graphs...
The paper considers finite and undirected simple connected graphs. Usually, graph labeling is an ass...
Graph labeling is one of the topics of graph theory that is growing very rapidly both in terms of th...
Let G be an undirected, connected, and simple graph with edges set E(G)and vertex set V(G). An edge ...
For a graph G that have vertex set V and edge set E. A labelling f:VUE->{1,2,3,...,k} is called a ve...
This paper we propose graceful labeling and labeling on a graph then referred to as 8-Bintang grap...
Graph is not an empty a finite of the objects that called point (vertex) with the couple was not th...
Let be a graph with and are the set of its vertices and edges, respectively. Total...
A face irregular entire labeling is introduced by Baca et al. recently, as a modification of the wel...
This paper deals with the total irregularity strength of complete bipartite graph where ...
A graph with n vertex and m edges is said to be cubic graceful labeling if its vertices are labeled ...
A graph labeling is an assignment of integers to the vertices or edges or both subject to certain co...
A graph that has odd harmonious labeling properties is called an odd harmonious graph. The purpose o...
Graph class which has the characteristic of odd harmonious labeling is called as odd harmonious grap...
Let G=(V(G), E(G)) be a connected graph with order |V(G)|=p and size |E(G)|=q. A graph G is said to ...
This paper deals with the totally irregular total labeling of the disjoin union of friendship graphs...
The paper considers finite and undirected simple connected graphs. Usually, graph labeling is an ass...
Graph labeling is one of the topics of graph theory that is growing very rapidly both in terms of th...
Let G be an undirected, connected, and simple graph with edges set E(G)and vertex set V(G). An edge ...
For a graph G that have vertex set V and edge set E. A labelling f:VUE->{1,2,3,...,k} is called a ve...
This paper we propose graceful labeling and labeling on a graph then referred to as 8-Bintang grap...
Graph is not an empty a finite of the objects that called point (vertex) with the couple was not th...
Let be a graph with and are the set of its vertices and edges, respectively. Total...
A face irregular entire labeling is introduced by Baca et al. recently, as a modification of the wel...
This paper deals with the total irregularity strength of complete bipartite graph where ...
A graph with n vertex and m edges is said to be cubic graceful labeling if its vertices are labeled ...
A graph labeling is an assignment of integers to the vertices or edges or both subject to certain co...