Title of article
Maximal value of the zeroth-order Randić index Original Research Article
Author/Authors
Ljiljana Pavlovi?، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
12
From page
615
To page
626
Abstract
Let G(n,m) be a connected graph without loops and multiple edges which has n vertices and m edges. We find the graphs on which the zeroth-order connectivity index, equal to the sum of degrees of vertices of G(n,m) raised to the power −12, attains maximum.
Keywords
Zeroth-order connectivity index , Extremal graph
Journal title
Discrete Applied Mathematics
Serial Year
2003
Journal title
Discrete Applied Mathematics
Record number
885561
Link To Document