Logarithmic Mean Labeling of Some Cycle Related Graphs
A.Durai Baskar1, A. Rajesh Kannan2, R.Rathajeyalakshmi3, P. Manivannan4
1A.Durai Baskar, Research Scholar of Mathematics, Bharathiar University, Coimbatore (Tamil Nadu), India.
2A.Rajesh Kannan, Department of Mathematics, Mepco Schlenk Engineering College, Sivakasi (Tamil Nadu), India.
3R.Rathajeyalakshmi, Department of Mathematics, Mepco Schlenk Engineering College, Sivakasi (Tamil Nadu), India.
4P. Manivannan, 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: 1204-1207 | Volume-8 Issue-7, May 2019 | Retrieval Number: G6355058719/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: A function f is called a logarithmic mean labeling of a graph G(V, E) with p vertices and q edges if f1V(G) → {1,2,3,…, q+1}is injective and the induced function f* E(G) → {1,2,3,…,q}defined as
Keyword: Labeling, Logarithmic Mean Labeling, Logarithmic Mean Graph.
Scope of the Article: Cryptography and Applied Mathematics.