Abstract
Let G be a simple connected graph with n vertices and m edges with vertex degree sequence d1 ≥ d2 ≥ . . . ≥ dn > 0. Denote by F = Σni =1 d3i forgotten topological index of graph G. In this paper we give some lower bounds for invariant F. Also, obtained bounds are compared with some known bounds from the literature.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 callMore From: Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics
Paper Title
Journal
Date
