Abstract
The F-index of a graph Q is defined as F(Q)=∑t∈V(Q)(dt)3. In this paper, we use edge swapping transformations to find the extremal value of the F-index among the class of trees with given order, pendent vertices, and diameter. We determine the trees with given order, pendent vertices, and diameter having the greatest F-index value. Also, the first five maximum values of F index among the class of trees with given diameter are determined.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
