A Novel Approach to Cexp Average Assignments on Chain Graphs
DOI:
https://doi.org/10.21123/bsj.2024.11034Keywords:
Cexp average assignment, Cexp average assignment graph, Chain graphs, Edge labeling, Vertex labeling.Abstract
In general, the exponential average of two positive numbers does not have to be an integer. Because of this, the exponential average needs to be an integer that takes into consideration the flooring or ceiling function. It has been defined that graphs can be labeled with an exponential average, where the flooring function or the ceiling function can apply labels to the edges. To establish the exponential average assignment on graphs, consider the edge labels that arise from the ceiling function alone. The vertex assignment function and edge assignment function are called a Cexp average assignment of the graph G with p vertices and q edges if is injective and is bijective and the corresponding relations are and is defined by edge label is where and N is the set of all natural numbers. If the graph accepts a Cexp average assignment then it is called a Cexp average assignment graph. The Cexp average assignment of graphs is proposed in this paper, and its characteristics are explored on the cycle, the union of path and cycle, the union of T- graph and cycle, the graph G*, the graph , the graph and tadpole.
Received 26/02/2024
Revised 21/06/2024
Accepted 23/06/2024
Published Online First 20/10/2024
References
West DB. Introduction to Graph Theory. 2nd edition. India: Pearson Education Inc.; 2001. 512 p.
Gallian JA. A Dynamic Survey of Graph Labeling. 26th edition. Electron. J Comb. 2022; 644 p. https://doi.org/10.37236/27.
Barrientos C, Minion S. Snakes: From Graceful to Harmonious. Bull. Inst. Combin. Appl. 2017; 79: 95–107.
Baskar AD, Arockiaraj S, Rajendran B. F-Geomentric Mean Labeling of Some Chain Graphs and Thorn Graphs. Kragujev. J Math. 2013; 37(1): 163–186.
Uma Devi M, Kamaraj M, Arockiaraj S. Odd Fibonacci Edge Irregular Labeling for Some Trees Obtained from Subdivision and Vertex Identification Operations. Baghdad Sci J. 2023; 20(1(SI)): 332-338. https://dx.doi.org/10.21123/bsj.2023.8420
Baskaran T, GanapathyR. A Study on C-Exponential Mean Labeling of Graphs. J Math. 2022; 2022: 1-7. https://doi.org/10.1155/2022/2865573
Khan A, Hayat S, Zhong Y, Arif A, Zada L, Fang M. Computational and Topological Properties of Neural Networks by Means of Graph-Theoretic Parameters. Alex Eng J 2023; 66: 957-977. https://doi.org/10.1016/j.aej.2022.11.001.
Ashwini J, PethanachiSelvam S, Gnanajothi R.B. Some New Results on Lucky Labeling. Baghdad Sci J. 2023; 20(1(SI)): 365-370. https://doi.org/10.21123/bsj.2023.8569.
Muthugurupackiam K, Pandiaraj P, Gurusamy R, Muthuselvam I. Further Results on (a, d) -Total Edge Irregularity Strength of Graphs. Baghdad Sci J. 2023; 20(6(Suppl.)): 2498-2507. https://dx.doi.org/10.21123/bsj.2023.8545.
Kannan AR, Manivannan P, Loganathan K, Prabu K, Gyeltshen S. Assignment Computations Based on Cexp Average in Various Ladder Graphs. J Math. 2022; 2022:1-8. https://doi.org/10.1155/2022/2635564
Downloads
Issue
Section
License
Copyright (c) 2024 A. Rajesh Kannan
This work is licensed under a Creative Commons Attribution 4.0 International License.
How to Cite
