Abstract
In this work, by using the properties of the variable sum exdeg indices and analyzing the structure of the quasi-tree graphs and unicyclic graphs, the minimum and maximum variable sum exdeg indices of quasi-tree graphs and quasi-tree graphs with perfect matchings were presented; the minimum and maximum variable sum exdeg indices of unicyclic graphs with given pendant vertices and cycle length were determined.
Highlights
Topological indices are mathematical descriptors reflecting some structural characteristics of organic molecules on molecular graphs, and they play an important role in pharmacology, chemistry, etc. ([1,2,3])
Where a ∈ (0, 1) ∪ (1, +∞) and dG(v) is the degree of vertex v. is graph invariant has a good correlation with the octanol-water partition coefficient [4] and was used to study the octane isomers given by the International Academy of Mathematical Chemistry (IAMC) [5,6,7]
Erefore, our results may be used to predict the extremal properties of organic molecules
Summary
Where a ∈ (0, 1) ∪ (1, +∞) and dG(v) is the degree of vertex v. is graph invariant has a good correlation with the octanol-water partition coefficient [4] and was used to study the octane isomers given by the International Academy of Mathematical Chemistry (IAMC) [5,6,7]. By using the technique of majorization, Ghalavand and Ashrafi [9] provided the maximal and minimal SEIa (for a > 1) of trees, bicyclic graphs, unicyclic graphs, and tricyclic graphs. We use NG(v) to denote the neighbourhood of a vertex v and ni to denote the number of vertices with degree i.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.