Add to ORKGLet G(V, E) be a graph with p vertices and q edges. A labeling is an assignment of numbers to vertices. For every labeling f: V(G) {0, 1, 2,…, q}, an induced edge labeling f*: E(G){1,2,…,q}is defined by 2 vfuf uvf , if f(u) and f(v) are of same parity and
A graph G=(V,E) with p vertices and q edges is said to be a mean graph if it is possible to label th...
Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges call...
LetG=(V,E) be a simple graph and let P_i be Pell numbers. For a bijectionf:V\left(G\right)\rightarro...
Let G = (V, E) be a graph with p vertices and q edges. Let f: V → {0, 1, 2, · · · , k} (1 ≤ k ≤ q...
Abstract: Let G be a (p, q) graph and let f: V (G) → {0, 1, · · · , q} be an injection. Then G is...
Abstract: Let G(V,E) be a graph with p vertices and q edges. A vertex labeling of G is an assignment...
Let G=(V,E) be a simple, finite and undirected (p,q)-graph with p vertices and q edges. A graph G is...
Abstract: Let k ≥ 0 be an integer. A Smarandachely vertex-mean k-labeling of a (p, q) graph G = (V, ...
Throughout this paper, by a graph we mean a finite, undirected and simple graph. Let G(V,E) be a gra...
By a graph we mean a finite, simple and undirected one. The vertex set and the edge set of a graph G...
A graph G (V, E) with p vertices and q edges is said to have skolem difference mean labeling if it i...
A graph G =(V,E) with p vertices and q edges is said to have skolem difference mean labeling if it i...
A $(p,q)$ graph $G$ is said to have a $k$-odd mean labeling $(k ge 1)$ if there exists an inj...
Let G(V;E) be a graph with p vertices and q edges. A function f is called even harmonious labeling o...
Abstract: A vertex labeling of G is an assignment f: V (G) → {1, 2, 3,..., p + q} be an injection. ...
A graph G=(V,E) with p vertices and q edges is said to be a mean graph if it is possible to label th...
Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges call...
LetG=(V,E) be a simple graph and let P_i be Pell numbers. For a bijectionf:V\left(G\right)\rightarro...
Let G = (V, E) be a graph with p vertices and q edges. Let f: V → {0, 1, 2, · · · , k} (1 ≤ k ≤ q...
Abstract: Let G be a (p, q) graph and let f: V (G) → {0, 1, · · · , q} be an injection. Then G is...
Abstract: Let G(V,E) be a graph with p vertices and q edges. A vertex labeling of G is an assignment...
Let G=(V,E) be a simple, finite and undirected (p,q)-graph with p vertices and q edges. A graph G is...
Abstract: Let k ≥ 0 be an integer. A Smarandachely vertex-mean k-labeling of a (p, q) graph G = (V, ...
Throughout this paper, by a graph we mean a finite, undirected and simple graph. Let G(V,E) be a gra...
By a graph we mean a finite, simple and undirected one. The vertex set and the edge set of a graph G...
A graph G (V, E) with p vertices and q edges is said to have skolem difference mean labeling if it i...
A graph G =(V,E) with p vertices and q edges is said to have skolem difference mean labeling if it i...
A $(p,q)$ graph $G$ is said to have a $k$-odd mean labeling $(k ge 1)$ if there exists an inj...
Let G(V;E) be a graph with p vertices and q edges. A function f is called even harmonious labeling o...
Abstract: A vertex labeling of G is an assignment f: V (G) → {1, 2, 3,..., p + q} be an injection. ...
A graph G=(V,E) with p vertices and q edges is said to be a mean graph if it is possible to label th...
Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges call...
LetG=(V,E) be a simple graph and let P_i be Pell numbers. For a bijectionf:V\left(G\right)\rightarro...