Affiliations: [a]
Department of Mathematics, Mepco Schlenk Engineering College, Sivakasi, Tamil Nadu, India
| [b]
Department of Mathematics, Ayya Nadar Janaki Ammal College (Affiliated to Madurai Kamaraj University), Sivakasi, Tamil Nadu, India
| [c]
Department of Mathematics, Anna University Regional Campus, Madurai, Tamil Nadu, India
Correspondence:
[*]
Corresponding author. A. Rajesh Kannan, Department of Mathematics, Mepco Schlenk Engineering College, Sivakasi-626005, Tamil Nadu, India. E-mail: [email protected].
Abstract: Consider the graph G, with the injection Ω from node set to the first p + q natural numbers. Let us assume that the ceiling function of the classical average of the node labels of the end nodes of each link is the induced link assignment Ω
*. If the union of range of Ω of node set and the range of Ω
* of link set is all the first p + q natural numbers, then Ω is called a classical mean labeling. A super classical mean graph is a graph with super classical mean labeling. In this research effort, we attempted to address the super classical meanness of graphs generated by paths and those formed by the union of two graphs.
Keywords: Labeling, super classical mean labeling, super classical mean graph
