… We contribute some new results for mean labeling of graphs. It has been proved that the
graphs … of path Pn and the middle graph of path Pn admit mean labeling. We also investigate …

… mean graph, particularly, a mean graph if m= 2. In this paper, some new families of mean
graphs … We prove that the graph obtained by two new operations called mutual duplication of a …

… of trees and for some special graphs [4,5]. In this paper, we investigate (k, 1)mean labeling
for some new families of graphs. Here k and d denote any positive integer greater than or …

… families of such graphs … families nor for proving chromatic uniqueness seems to be known.
Here we study the possibilities of deriving new chromatically unique graphs from the graphs …

… Our systems of generators are "global" in some sense: … family of graphs, so called "Ramanujan"
(see the definition preceding Theorem 4.3 below), which are obtained as Cayley graphs …

… We prove that the step ladder graph, total graph of path P are mean graphs. In addition to
this we derive that two copies of cycle C sharing a common edge admits … Mean labeling …

… families of graphs defined by a class of systems of equations over commutative rings. We
show that the graphs in all such families possess some … of the same family. Another general …

… In this paper we investigate some new families of edge product cordial graph. … some new
results on edge product cordial labeling. The labeling pattern is demonstrated by means of …

… Throughout this paper by a graph we mean a finite, simple and undirected graph. For … odd
harmonious labeling of graphs: (i) If G is an odd harmonious graph, then G is a bipartite graph. …

… graph or graph families which admit prime cordial labeling. In this paper we have investigated
some new … To investigate similar results for other graph families and in the context of …