Super C-Logarithmic Meanness of Graphs Obtained from Paths
A.Durai Baskar1, S.Saratha Devi2
1A.Durai Baskar, Research Scholar of Mathematics, Bharathiar University, Coimbatore (Tamil Nadu), India.
2S.Saratha Devi, Department of Mathematics, Mepco Schlenk Engineering College, Sivakasi (Tamil Nadu), India.
Manuscript received on 01 May 2019 | Revised Manuscript received on 15 May 2019 | Manuscript published on 30 May 2019 | PP: 1145-1149 | Volume-8 Issue-7, May 2019 | Retrieval Number: G6344058719/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Two functions namely and is defined for a graph whose order and size as is an injective and is an induced bijective function of respectively. Then is called a Super -logarithmic mean labeling if A graph that admits a Super -logarithmic mean labeling is called a Super -logarithmic mean graph. In this manuscript, some of the graphs like path, total graph of a path, middle graph of a path, triangular ladder, the graph for the graph the graph subdivision of and the arbitrary subdivision of admits Super -logarithmic mean labeling.
Keyword: Labeling, Logarithmic Mean Labeling, Logarithmic Mean Graph.
Scope of the Article: Cryptography and Applied Mathematics.