Add to ORKGThe paper considers finite and undirected simple connected graphs. Usually, graph labeling is an assignment of integers to the vertices or edges in the method. Naturally, Graphs arose in the study of Graham and Slaone Modular versions of additive based problems. Hence, the researcher have introduced Even-Odd Prime Harmonious Labeling of Graphs and I prove that the Path where n is odd, Star 1, and Comb graph . 1, n is even, are even-odd harmonious graphs. By the use of even-odd prime harmonious labeling concepts, one can find out the significance of even-odd prime harmonious graphs
In this paper, some necessary and sufficient conditions for an n normed spaces to be an n inner prod...
A face irregular entire labeling is introduced by Baca et al. recently, as a modification of the wel...
A diverging unidirectional perfect binary tree is a unidirectional perfect binary tree in which ever...
A subset of vertices of a simple connected graph is a neighborhood set (n-set) of G if G is the un...
In this paper we define infinite-dimensional algebra and its representation, whose basis is naturall...
Let G=(V(G), E(G)) be a path or cycle graph. A subset D of V(G) is a dominating set of G if for ever...
Let be a graph with vertex set and edge set . If is a set of vertices of , then is the union o...
We investigate when two four-term arithmetic progressions have an equal product of their terms. Thi...
We present two results of Game Theory, very important in Economics: minimax theorem and Nash equilib...
In this paper we introduce the concept of connected vertex strong geodetic number\ cg_{sx}(G) of a g...
Let be a simple connected graph of order Let be the family of connected vertex-edge dominating set...
Abstract A graph of order and size is called an(,)-edge-antimagic if there exist a bijection ∶ (...
A graph of order and size is called an(,)-edge-antimagic if there exist a bijection ∶ () ∪ () → {...
Let p > 3 be a prime number and let r be an integer with 1 < r < p - 1. For each r, let moreover G(r...
We introduce some generalizations of Prešić type contractions and establish some fixed point theorem...
In this paper, some necessary and sufficient conditions for an n normed spaces to be an n inner prod...
A face irregular entire labeling is introduced by Baca et al. recently, as a modification of the wel...
A diverging unidirectional perfect binary tree is a unidirectional perfect binary tree in which ever...
A subset of vertices of a simple connected graph is a neighborhood set (n-set) of G if G is the un...
In this paper we define infinite-dimensional algebra and its representation, whose basis is naturall...
Let G=(V(G), E(G)) be a path or cycle graph. A subset D of V(G) is a dominating set of G if for ever...
Let be a graph with vertex set and edge set . If is a set of vertices of , then is the union o...
We investigate when two four-term arithmetic progressions have an equal product of their terms. Thi...
We present two results of Game Theory, very important in Economics: minimax theorem and Nash equilib...
In this paper we introduce the concept of connected vertex strong geodetic number\ cg_{sx}(G) of a g...
Let be a simple connected graph of order Let be the family of connected vertex-edge dominating set...
Abstract A graph of order and size is called an(,)-edge-antimagic if there exist a bijection ∶ (...
A graph of order and size is called an(,)-edge-antimagic if there exist a bijection ∶ () ∪ () → {...
Let p > 3 be a prime number and let r be an integer with 1 < r < p - 1. For each r, let moreover G(r...
We introduce some generalizations of Prešić type contractions and establish some fixed point theorem...
In this paper, some necessary and sufficient conditions for an n normed spaces to be an n inner prod...
A face irregular entire labeling is introduced by Baca et al. recently, as a modification of the wel...
A diverging unidirectional perfect binary tree is a unidirectional perfect binary tree in which ever...