ISSN 2234-8417 (Online) ISSN 1598-5857 (Print)

Table of Contents
2017's   35,5-6(Sept)
    By A.Lourdusamy ..........1750
Generic Number - 1750
References - 14
Written Date - September 26th, 17
Modified Date - September 26th, 17
Downloaded Counts - 33
Visited Counts - 210
Original File
In this paper we continue to investigate the Super Vertex Mean behaviour of all graphs up to order 5 and all regular graphs up to order 7. Let G(V,E) be a graph with p vertices and q edges. Let f be an injection from E to the set {1, 2, 3, · · · , p + q} that induces for each vertex v the label defined by the rule, where Ev denotes the set of edges in G that are incident at the vertex v, such that the set of all edge labels and the induced vertex labels is {1, 2, 3, · · · , p+q}. Such an injective function f is called a super vertex mean labeling of a graph G and G is called a Super Vertex Mean Graph.

The Korean Society for Computational and Applied Mathematics
Copyright ⓒ 2017 JAMI. All rights reserved.  E-mail :
Main Office Address: DongNam-Ku, BongMyung 1-kil 47, Ra-104, CheonAn, ChungNam 330-900, KOREA.