Consecutive chemical trees with respect to energy of graph. (3rd April 2021)

• Record Type: Journal Article
• Authors: Kazi, Sabeena
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 24:Number 3(2021)
• Page Start: 827
• Page End: 841
• Publication Date: 2021-04-03
• Subjects: 05C05; Chemical trees -- Energy of graphs -- Edge independence number; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2020.1864936
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: A chemical tree is a tree in which no vertex has a degree greater than four. Two trees T 1 and T 2 of same orders p, are said to be consecutive trees with respect to the energy, if there exists no tree T of order p satisfying E ( T 1 ) < E ( T ) < E ( T 2 ). In this paper the author gives the consecutive chemical trees with respect to energies with edge independence number, denoted by t p ( i ) where i is the edge independence number and i = 2, 3 and p is the number of vertices. And give the table listing all the possible energy consecutive chemical trees tp ( i ), i = 2, 3, their polynomials and energies.