A $(p,q)$ graph $G$ is said to have a $k$-odd mean labeling $(k ge 1)$ if there exists an injection $f : V to {0, 1, 2, ldots, 2k + 2q - 3}$ such that the induced map $f^*$ defined on $E$ by $f^*(uv) = leftlceil frac{f(u)+f(v)}{2}rightrceil$ is a bijection from $E$ to ${2k - 1, 2k + 1, 2k + 3, ldots, 2 k + 2q - 3}$. A graph that admits $k$-odd mean labeling is called $k$-odd mean graph. In this paper, we investigate $k$-odd mean labeling of prism $C_m times P_n$
A graph G =(V,E) with p vertices and q edges is said to have skolem difference mean labeling if it i...
Let G = (V;E) be a graph with p vertices and q edges. A graph G is said have an even vertex odd mean...
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 G be a (p, q) graph and let f: V (G) → {0, 1, · · · , q} be an injection. Then G is...
Abstract: Let G be a (p,q) graph and f: V (G) → {1, 2,3,..., p + q} be an injection. For each edge ...
All graphs considered here are finite, undirected and simple graph. We follow the basic notations an...
A graph that admits skolem difference odd mean labeling is called a skolem difference odd mean graph...
Let graph G=(V(G),E(G)) attains a Skolem difference mean labeling with p vertices and q edges is sai...
Let G(V, E) be a graph with p vertices and q edges. A labeling is an assignment of numbers to vertic...
Abstract: Let k ≥ 0 be an integer. A Smarandachely vertex-mean k-labeling of a (p, q) graph G = (V, ...
A graph G with p vertices and q edges is said to have a skolem difference odd mean labeling if there...
A graph G (V, E) with p vertices and q edges is said to have skolem difference mean labeling if it i...
Let G be a graph with p vertices and q edges and an injective function where each is a odd Fibonac...
Graph labeling can be mentioned as one of the most prominent research areas in graph theory and the ...
A graph G =(V,E) with p vertices and q edges is said to have skolem difference mean labeling if it i...
Let G = (V;E) be a graph with p vertices and q edges. A graph G is said have an even vertex odd mean...
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 G be a (p, q) graph and let f: V (G) → {0, 1, · · · , q} be an injection. Then G is...
Abstract: Let G be a (p,q) graph and f: V (G) → {1, 2,3,..., p + q} be an injection. For each edge ...
All graphs considered here are finite, undirected and simple graph. We follow the basic notations an...
A graph that admits skolem difference odd mean labeling is called a skolem difference odd mean graph...
Let graph G=(V(G),E(G)) attains a Skolem difference mean labeling with p vertices and q edges is sai...
Let G(V, E) be a graph with p vertices and q edges. A labeling is an assignment of numbers to vertic...
Abstract: Let k ≥ 0 be an integer. A Smarandachely vertex-mean k-labeling of a (p, q) graph G = (V, ...
A graph G with p vertices and q edges is said to have a skolem difference odd mean labeling if there...
A graph G (V, E) with p vertices and q edges is said to have skolem difference mean labeling if it i...
Let G be a graph with p vertices and q edges and an injective function where each is a odd Fibonac...
Graph labeling can be mentioned as one of the most prominent research areas in graph theory and the ...
A graph G =(V,E) with p vertices and q edges is said to have skolem difference mean labeling if it i...
Let G = (V;E) be a graph with p vertices and q edges. A graph G is said have an even vertex odd mean...
Abstract: Let G(V,E) be a graph with p vertices and q edges. A vertex labeling of G is an assignment...