In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number Fn+2 and the Fibonacci number of the cycle graph Cn is the Lucas number Ln. The tadpole graph Tn,k is the graph created by concatenating Cn and Pk with an edge from any vertex of Cn to a pe...

The aim of this work is to investigate the F-index and F-coindex of the line graphs of the cycle graphs, star graphs, tadpole graphs, wheel graphs and ladder graphs using the subdivision concepts. F-index of the line graph of subdivision graph of square grid graph, 2D-lattice, nanotube and nanotorus of TUC4C8[p, q] are also investigated here.

Consider a robot that is navigating in space represented by graph and wants to know its current location. It can send signal find out how far it from each set of fixed landmarks. We study the problem computing minimum number landmarks required, where they should be placed so always determine The nodes are located called metric basis graph, dimension graph. On other hand, G smallest size ...

Inspired by the chemical applications of higher-order connectivity index (or Randic index), we consider here the higher-order first Zagreb index of a molecular graph. In this paper, we study the linear regression analysis of the second order first Zagreb index with the entropy and acentric factor of an octane isomers. The linear model, based on the second order first Zag...