A Study on C-Exponential Mean Labeling of Graphs

Thamaraiselvi Baskaran, Rajasekaran Ganapathy and A. Ghareeb

Journal of Mathematics, 2022, vol. 2022, 1-7

Abstract: A function h is mentioned as a C-exponential mean labeling of a graph GV,E that has s vertices and r edges if h:VG⟶1,2,3,⋯,r+1 is injective and the generated function h∗:EG⟶2,3,4,⋯,r+1 defined by h∗ab=1/ehbhb/haha1/hb−ha, for all ab∈EG, is bijective. A graph which recognizes a C-exponential mean labeling is defined as C-exponential mean graph. In the following study, we have studied the exponential meanness of the path, the graph triangular tree of Tn, CmPn, cartesian product of two paths Pm▫Pn, one-sided step graph of STn, double-sided step graph of 2ST2n, one-sided arrow graph of Ars, double-sided arrow graph of DArs, and subdivision of ladder graph SLt.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/2865573.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/2865573.xml (application/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:jjmath:2865573

DOI: 10.1155/2022/2865573

Access Statistics for this article

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