Abstract
In this paper we will show applications of the Fibonacci numbers and the telephone numbers in edge coloured unicyclic graphs. In particular, we give the upper bound for the ( A , 2 B ) -index in unicyclic graphs. Moreover, we give characterization of the extremal graph achieving this maximum value. We also show connections between the number of ( A , 2 B ) -edge colourings in the class of unicyclic graphs and the telephone numbers as well as the Fibonacci numbers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
