论文信息 - Bound for vertex PI index in terms of simple graph parameters

Bound for vertex PI index in terms of simple graph parameters

The vertex PI index is a distance-based molecular structure descriptor, that recently found numerouschemicalapplications. InthisletterweobtainalowerboundonthevertexPIindexofaconnected graph in terms of number of vertices, edges, pendent vertices, and clique number, and characterize the extremal graphs.

Kinkar Ch. Das | Ivan Gutman

[1] I. Gutman. Mircea V. Diudea, Margareta S. Florescu, and Padmakar V. Khadikar: Molecular Topology and Its Applications , 2007 .

[2] Sandi Klavžar,et al. The Szeged and the Wiener Index of Graphs , 1996 .

[3] Aleksandar Ilic,et al. Note on PI and Szeged indices , 2010, Math. Comput. Model..

[4] Ali Reza Ashrafi,et al. Vertex and edge PI indices of Cartesian product graphs , 2008, Discret. Appl. Math..

[5] Kinkar Ch. Das,et al. Estimating the Vertex PI Index , 2010 .

[6] Aleksandar Ilic. On the extremal graphs with respect to the vertex PI index , 2010, Appl. Math. Lett..

[7] Kinkar Chandra Das,et al. Estimating the Szeged index , 2009, Appl. Math. Lett..

[8] I. Gutman,et al. Mathematical Concepts in Organic Chemistry , 1986 .

[9] Dragan Stevanovic,et al. Bicyclic graphs with extremal values of PI index , 2013, Discret. Appl. Math..

[10] M. J. Nadjafi-Arani,et al. Extremal graphs with respect to the vertex PI index , 2009, Appl. Math. Lett..

[11] Roberto Todeschini,et al. Molecular descriptors for chemoinformatics , 2009 .