New upper bounds for the forgotten index among bicyclic graphs
Keyword(s):
The forgotten topological index of a graph $G$, denoted by $F(G)$, is defined as the sum of weights $d(u)^{2}+d(v)^{2}$ over all edges $uv$ of $G$, where $d(u)$ denotes the degree of a vertex $u$. 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.
Keyword(s):
Keyword(s):
Keyword(s):
2014 ◽
Vol 06
(02)
◽
pp. 1450029
◽
Keyword(s):
2013 ◽
Vol 439
(9)
◽
pp. 2527-2541
◽
Keyword(s):
2002 ◽
Vol 11
(1)
◽
pp. 103-111
◽