Photo from wikipedia
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… Click to show full 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.
Keywords:
trees given;
index;
trees greatest;
edge swapping;
greatest invariant
Journal Title: Computational Intelligence and Neuroscience
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Computational Intelligence and Neuroscience
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!