Odd Fibonacci edge irregular labeling for some trees obtained from subdivision and vertex identification operations

Authors

M. Uma Devi, Department of Mathematics, Government Arts and Science College, Sivakasi, Tamilnadu, India.Follow
M. Kamaraj, Department of Mathematics, Government Arts and Science College, Sivakasi, Tamilnadu, India.Follow
S. Arockiaraj, Department of Mathematics, Government Arts and Science College, Sivakasi, Tamilnadu, India.Follow

Abstract

Let G be a graph with p vertices and q edges and be an injective function, where k is a positive integer. If the induced edge labeling defined by for each is a bijection, then the labeling f is called an odd Fibonacci edge irregular labeling of G. A graph which admits an odd Fibonacci edge irregular labeling is called an odd Fibonacci edge irregular graph. The odd Fibonacci edge irregularity strength ofes(G) is the minimum k for which G admits an odd Fibonacci edge irregular labeling. In this paper, the odd Fibonacci edge irregularity strength for some subdivision graphs and graphs obtained from vertex identification is determined.

Keywords

Edge irregular labeling, Edge irregularity strength, Irregular labeling, Odd Fibonacci edge irregular labeling, Odd Fibonacci sequence

Article Type

Special Issue Article

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite this Article

Devi, M. Uma; Kamaraj, M.; and Arockiaraj, S. (2023) "Odd Fibonacci edge irregular labeling for some trees obtained from subdivision and vertex identification operations," Baghdad Science Journal: Vol. 20: Iss. 1, Article 41.
DOI: https://doi.org/10.21123/bsj.2023.8420