New upper bounds for the forgotten index among bicyclic graphs
Combinatorics
2021-02-05 v1 Discrete Mathematics
Abstract
The forgotten topological index of a graph , denoted by , is defined as the sum of weights over all edges of , where denotes the degree of a vertex . In this paper, we give sharp upper bounds of the F-index (forgotten topological index) over bicyclic graphs, in terms of the order and maximum degree.
Cite
@article{arxiv.2102.02415,
title = {New upper bounds for the forgotten index among bicyclic graphs},
author = {A. Jahanbani and L. Shahbazi and S. M. Sheikholeslami and R. Rasi and J. Rodriguez},
journal= {arXiv preprint arXiv:2102.02415},
year = {2021}
}