EXTREMAL F-INDEX OF A GRAPH WITH k CUT EDGES

Authors

  • R. Amin Department of Education, Assam University, Silchar – 788 011, India Author
  • S.M.A. Nayeem Department of Mathematics and Statistics, Aliah University, Kolkata – 700 160, India Author

Keywords:

F-index, cut edges, transformation

Subjects:

05C35, 05C07, 05C40

Abstract

The so called forgotten index or F-index is defined as the sum of cubes of vertex degrees of a molecular graph. In this paper, we have obtained the upper and lower bounds of F-index for the graphs with k cut edges and also we have characterized the extremal graphs.

Downloads

Published

2020-04-15

Issue

Vol. 72 No. 2 (2020): Vol. 72, Issue 2

Section

Articles

License

Copyright (c) 2020 Authors retain copyright to their work.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.