期刊名称：International Journal of Mathematics and Mathematical Sciences
印刷版ISSN：0161-1712
电子版ISSN：1687-0425
出版年度：2018
卷号：2018
DOI：10.1155/2018/9250424
出版社：Hindawi Publishing Corporation
摘要：Let be a graph with the vertex set and the edge set , respectively. By a graph we mean a finite undirected graph with neither loops nor multiple edges. The number of vertices of is called order of and it is denoted by . Let be a graph. A super mean graph on is an injection such that, for each edge in labeled by , the set forms . A graph which admits super mean labeling is called super mean graph. The total graph of is the graph with the vertex set and two vertices are adjacent whenever they are either adjacent or incident in . We have showed that graphs and are super mean, where is a path on vertices and is a cycle on vertices.
