In this study, we investigate a new kind of mean labeling of graph. The ladder graph plays an important role in the area of communication networks, coding theory, and transportation engineering. Also, we found interesting new results corresponding to classical mean labeling for some ladder-related graphs and corona of ladder graphs with suitable examples
A graph that admits a Smarandachely super mean m-labeling is called Smarandachely super m-mean graph
Let graph G=(V(G),E(G)) attains a Skolem difference mean labeling with p vertices and q edges is sai...
A simple graph is said to be a vertex -graceful if there exists a vertex graceful labeling on the ...
In the present paper, we introduce the classical mean labeling of graphs and investigate their relat...
Throughout this paper, by a graph we mean a finite, undirected and simple graph. Let G(V,E) be a gra...
We contribute some new results for mean labeling of graphs. It has been proved that the graphs obtai...
A graph G with p vertices and q edges. A Root Square Mean Labeling of graph is an injective functio...
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...
Let be an undirected graph having vertices and edges. Now, defining a function say, is called Power-...
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireles...
In this paper we investigate mean cordial labeling behavior of union of some graphs, square of paths...
In this paper, we introduce new labeling and named it as k-total edge mean cordial (k-TEMC) labeling...
All graphs considered here are finite, undirected and simple graph. We follow the basic notations an...
The concept of a graph labeling is an active area of research in graph theory which has rigorous app...
A graph that admits a Smarandachely super mean m-labeling is called a Smarandachely super m-mean gra...
A graph that admits a Smarandachely super mean m-labeling is called Smarandachely super m-mean graph
Let graph G=(V(G),E(G)) attains a Skolem difference mean labeling with p vertices and q edges is sai...
A simple graph is said to be a vertex -graceful if there exists a vertex graceful labeling on the ...
In the present paper, we introduce the classical mean labeling of graphs and investigate their relat...
Throughout this paper, by a graph we mean a finite, undirected and simple graph. Let G(V,E) be a gra...
We contribute some new results for mean labeling of graphs. It has been proved that the graphs obtai...
A graph G with p vertices and q edges. A Root Square Mean Labeling of graph is an injective functio...
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...
Let be an undirected graph having vertices and edges. Now, defining a function say, is called Power-...
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireles...
In this paper we investigate mean cordial labeling behavior of union of some graphs, square of paths...
In this paper, we introduce new labeling and named it as k-total edge mean cordial (k-TEMC) labeling...
All graphs considered here are finite, undirected and simple graph. We follow the basic notations an...
The concept of a graph labeling is an active area of research in graph theory which has rigorous app...
A graph that admits a Smarandachely super mean m-labeling is called a Smarandachely super m-mean gra...
A graph that admits a Smarandachely super mean m-labeling is called Smarandachely super m-mean graph
Let graph G=(V(G),E(G)) attains a Skolem difference mean labeling with p vertices and q edges is sai...
A simple graph is said to be a vertex -graceful if there exists a vertex graceful labeling on the ...