Add to ORKGAbstract: A vertex labeling of G is an assignment f: V (G) → {1, 2, 3,..., p + q} be an injection. For a vertex labeling f, the induced Smarandachely edge m-labeling f∗S for an edge e = uv, an integer m ≥ 2 is defined by f∗S(e) = f(u) + f(v
Let G be a graph with p vertices and q edges. Let :V(G)E(G)→{1,2,3,...,p+q} be an injective function...
We contribute some new results for mean labeling of graphs. It has been proved that the graphs obtai...
A graph that admits a Smarandachely near mean m-labeling is called Smarandachely near m-mean graph. ...
Abstract: Let G(V,E) be a graph with p vertices and q edges. A vertex labeling of G is an assignment...
Abstract: Let G be a graph and f: V (G) → {1, 2, 3,..., p+ q} be an injection. For each edge e = uv ...
Abstract: Let k ≥ 0 be an integer. A Smarandachely vertex-mean k-labeling of a (p, q) graph G = (V, ...
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 ...
Let G(V, E) be a graph with p vertices and q edges. A labeling is an assignment of numbers to vertic...
Let G = (V, E) be a graph with p vertices and q edges. Let f: V → {0, 1, 2, · · · , k} (1 ≤ k ≤ q...
By a graph we mean a finite, simple and undirected one. The vertex set and the edge set of a graph G...
Let G be a graph with p vertices and q edges. Let qpGVf ,...,3,2,1)(: be an injective function. F...
A graph that admits a Smarandachely super mean m-labeling is called a Smarandachely super m-mean gra...
Let G(V,E) be a graph with the vertex set V and the edge set E, respectively. By a graph G=(V,E) we ...
A graph labeling is an assignment of integers to the vertices or edges or both subject to certain co...
Let G be a graph with p vertices and q edges. Let :V(G)E(G)→{1,2,3,...,p+q} be an injective function...
We contribute some new results for mean labeling of graphs. It has been proved that the graphs obtai...
A graph that admits a Smarandachely near mean m-labeling is called Smarandachely near m-mean graph. ...
Abstract: Let G(V,E) be a graph with p vertices and q edges. A vertex labeling of G is an assignment...
Abstract: Let G be a graph and f: V (G) → {1, 2, 3,..., p+ q} be an injection. For each edge e = uv ...
Abstract: Let k ≥ 0 be an integer. A Smarandachely vertex-mean k-labeling of a (p, q) graph G = (V, ...
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 ...
Let G(V, E) be a graph with p vertices and q edges. A labeling is an assignment of numbers to vertic...
Let G = (V, E) be a graph with p vertices and q edges. Let f: V → {0, 1, 2, · · · , k} (1 ≤ k ≤ q...
By a graph we mean a finite, simple and undirected one. The vertex set and the edge set of a graph G...
Let G be a graph with p vertices and q edges. Let qpGVf ,...,3,2,1)(: be an injective function. F...
A graph that admits a Smarandachely super mean m-labeling is called a Smarandachely super m-mean gra...
Let G(V,E) be a graph with the vertex set V and the edge set E, respectively. By a graph G=(V,E) we ...
A graph labeling is an assignment of integers to the vertices or edges or both subject to certain co...
Let G be a graph with p vertices and q edges. Let :V(G)E(G)→{1,2,3,...,p+q} be an injective function...
We contribute some new results for mean labeling of graphs. It has been proved that the graphs obtai...
A graph that admits a Smarandachely near mean m-labeling is called Smarandachely near m-mean graph. ...