A graph with the labeling properties of odd harmonic is called an odd harmonious graph. The purpose of this research was to get labeling properties of odd harmonic on the class of string graphs. The research used was a qualitative research method. The result of the research was that the definition and construction of a string graph, the union of a string graph, and the multiple string graph are obtained. Furthermore, it has been proved that a string graph, the union of a string graph, and the multiple string graph is an odd harmonious graph
<p>In [8] Liang and Bai have shown that the kC4 − snake graph is an odd harmonious graph for each k ...
In 1991, Gnanajothi [4] proved that the path graph n P with n vertex and n −1edge is odd graceful, a...
If a graph G admits integer cordial labeling, it is called an integer cordial graph. In this paper w...
A graph with the labeling properties of odd harmonic is called an odd harmonious graph. The purpose ...
Suppose is a simple and connected graph with edges. A harmonious labeling on a graph &nb...
Graph labeling is one of the topics of graph theory that is growing very rapidly both in terms of th...
Let G = (V, E) be a graph with p vertices and q edges. A graph G is said to be odd harmonious if the...
The labelling of discrete structures is an attractive research topic due to its vast range of applic...
The present paper investigates new idea of odd average harmonious labelling. A function h is known a...
Let G = be a graph, with and. An injective mapping is called an even-odd harmonious labeling of the ...
A graph G(p; q) is said to be odd harmonious if there exists aninjection f : V (G) ! f0; 1; 2; ; ...
In this paper, we show that the number of edges for any odd harmonious Eulerian graph is congruent t...
In this paper, we show that the number of edges for any odd harmonious Eulerian graph is congruent t...
AbstractA graph G with q edges is said to be harmonious if there is an injection f from the vertices...
A graph that has odd harmonious labeling properties is called an odd harmonious graph. The purpose o...
<p>In [8] Liang and Bai have shown that the kC4 − snake graph is an odd harmonious graph for each k ...
In 1991, Gnanajothi [4] proved that the path graph n P with n vertex and n −1edge is odd graceful, a...
If a graph G admits integer cordial labeling, it is called an integer cordial graph. In this paper w...
A graph with the labeling properties of odd harmonic is called an odd harmonious graph. The purpose ...
Suppose is a simple and connected graph with edges. A harmonious labeling on a graph &nb...
Graph labeling is one of the topics of graph theory that is growing very rapidly both in terms of th...
Let G = (V, E) be a graph with p vertices and q edges. A graph G is said to be odd harmonious if the...
The labelling of discrete structures is an attractive research topic due to its vast range of applic...
The present paper investigates new idea of odd average harmonious labelling. A function h is known a...
Let G = be a graph, with and. An injective mapping is called an even-odd harmonious labeling of the ...
A graph G(p; q) is said to be odd harmonious if there exists aninjection f : V (G) ! f0; 1; 2; ; ...
In this paper, we show that the number of edges for any odd harmonious Eulerian graph is congruent t...
In this paper, we show that the number of edges for any odd harmonious Eulerian graph is congruent t...
AbstractA graph G with q edges is said to be harmonious if there is an injection f from the vertices...
A graph that has odd harmonious labeling properties is called an odd harmonious graph. The purpose o...
<p>In [8] Liang and Bai have shown that the kC4 − snake graph is an odd harmonious graph for each k ...
In 1991, Gnanajothi [4] proved that the path graph n P with n vertex and n −1edge is odd graceful, a...
If a graph G admits integer cordial labeling, it is called an integer cordial graph. In this paper w...