Open AccessExponential meanness of some ladder related graphs
Author(s) -
A. Rajesh Kannan,
R. Ratha Jeyalakshmi,
P. Manivannan,
A. Baskar
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1597/1/012034
Subject(s) - algorithm , computer science
For a graph G = ( V , E ) define an injective function χ from V ( G ) to the set {1, 2, 3…, q + 1} and an induced bijective function χ* from E ( G ) to the set {1, 2, 3…, q } as χ * ( u v ) = ⌊ 1 e ( χ ( v ) χ ( v ) χ ( u ) χ ( u ) ) 1 χ ( v ) − χ ( u ) ⌋ , for all u v ∈ E ( G ) . Then χ is called an exponential mean labeling of G . A graph which allows an exponential mean labeling is called an exponential mean graph. In this article, we discuss an exponential mean labeling of some ladder graphs.