2021/02/04 by Akbar Jahanbani, L. Shahbazi, Jahanbani, A. +7
Chemistry · Computer Science · Mathematics · #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Synthesis and Properties of Aromatic Compounds
paper · pdf · doi:10.48550/arxiv.2102.02415
openalex publication_date 2021/02/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.