A graph that admits a Smarandachely super mean m-labeling is called a Smarandachely super m-mean graph, particularly, a mean graph if m = 2. In this paper, some new families of mean graphs are investigated. We prove that the graph obtained by two new operations called mutual duplication of a pair of vertices each from each copy of cycle Cn as well as mutual duplication of a pair of edges each from each copy of cycle Cn admits mean labeling
In this study, we investigate a new kind of mean labeling of graph. The ladder graph plays an import...
Mean sum square prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and t...
Abstract: A vertex labeling of G is an assignment f: V (G) → {1, 2, 3,..., p + q} be an injection. ...
A graph that admits a Smarandachely super mean m-labeling is called Smarandachely super m-mean graph
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 be a (p,q) graph and f: V (G) → {1, 2,3,..., p + q} be an injection. For each edge ...
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, ...
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 ...
Abstract: In this paper, we prove a conjecture that the three stars K1,l K1,m K1,n is a skolem mean ...
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...
All graphs considered here are finite, undirected and simple graph. We follow the basic notations an...
Abstract: Let G be a (p, q) graph and let f: V (G) → {0, 1, · · · , q} be an injection. Then G is...
Let f be a map from V(G) to. For each edge uv assign the label 0,1,2 2 f u f v . f is c...
In this study, we investigate a new kind of mean labeling of graph. The ladder graph plays an import...
Mean sum square prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and t...
Abstract: A vertex labeling of G is an assignment f: V (G) → {1, 2, 3,..., p + q} be an injection. ...
A graph that admits a Smarandachely super mean m-labeling is called Smarandachely super m-mean graph
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 be a (p,q) graph and f: V (G) → {1, 2,3,..., p + q} be an injection. For each edge ...
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, ...
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 ...
Abstract: In this paper, we prove a conjecture that the three stars K1,l K1,m K1,n is a skolem mean ...
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...
All graphs considered here are finite, undirected and simple graph. We follow the basic notations an...
Abstract: Let G be a (p, q) graph and let f: V (G) → {0, 1, · · · , q} be an injection. Then G is...
Let f be a map from V(G) to. For each edge uv assign the label 0,1,2 2 f u f v . f is c...
In this study, we investigate a new kind of mean labeling of graph. The ladder graph plays an import...
Mean sum square prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and t...
Abstract: A vertex labeling of G is an assignment f: V (G) → {1, 2, 3,..., p + q} be an injection. ...
DOI
Add to ORKG