F-Indices of Some Classes of Networks and Polygraphs

Abstract

For a (molecular) graph G, the F-index is defined as F = F(G) =  (u) =  (u) + (v)). In this paper, we obtain the exact formulae for the F- index of some classes of networks such as butterfly, benes and mesh derived network. In addition, the upper bounds for the F –index of polygraphs are obtained.