On Super Mean Labeling for Total Graph of Path and Cycle

Nur Inayah, I. Wayan Sudarsana, Selvy Musdalifah and Nurhasanah Daeng Mangesa

International Journal of Mathematics and Mathematical Sciences, 2018, vol. 2018, 1-5

Abstract:

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.

Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2018/9250424.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2018/9250424.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:9250424

DOI: 10.1155/2018/9250424

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().