A Study on C-Exponential Mean Labeling of Graphs
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 lab...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/2865573 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849473123071557632 |
|---|---|
| author | Thamaraiselvi Baskaran Rajasekaran Ganapathy |
| author_facet | Thamaraiselvi Baskaran Rajasekaran Ganapathy |
| author_sort | Thamaraiselvi Baskaran |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-d8c8acfefce94ede8e7fb5c863363ac4 |
| institution | Kabale University |
| issn | 2314-4785 |
| language | English |
| publishDate | 2022-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Mathematics |
| spelling | doaj-art-d8c8acfefce94ede8e7fb5c863363ac42025-08-20T03:24:16ZengWileyJournal of Mathematics2314-47852022-01-01202210.1155/2022/2865573A Study on C-Exponential Mean Labeling of GraphsThamaraiselvi Baskaran0Rajasekaran Ganapathy1Department of MathematicsDepartment of MathematicsA 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.http://dx.doi.org/10.1155/2022/2865573 |
| spellingShingle | Thamaraiselvi Baskaran Rajasekaran Ganapathy A Study on C-Exponential Mean Labeling of Graphs Journal of Mathematics |
| title | A Study on C-Exponential Mean Labeling of Graphs |
| title_full | A Study on C-Exponential Mean Labeling of Graphs |
| title_fullStr | A Study on C-Exponential Mean Labeling of Graphs |
| title_full_unstemmed | A Study on C-Exponential Mean Labeling of Graphs |
| title_short | A Study on C-Exponential Mean Labeling of Graphs |
| title_sort | study on c exponential mean labeling of graphs |
| url | http://dx.doi.org/10.1155/2022/2865573 |
| work_keys_str_mv | AT thamaraiselvibaskaran astudyoncexponentialmeanlabelingofgraphs AT rajasekaranganapathy astudyoncexponentialmeanlabelingofgraphs AT thamaraiselvibaskaran studyoncexponentialmeanlabelingofgraphs AT rajasekaranganapathy studyoncexponentialmeanlabelingofgraphs |