109 research outputs found
Eccentric connectivity index
The eccentric connectivity index is a novel distance--based molecular
structure descriptor that was recently used for mathematical modeling of
biological activities of diverse nature. It is defined as \,, where and
denote the vertex degree and eccentricity of \,, respectively. We survey
some mathematical properties of this index and furthermore support the use of
eccentric connectivity index as topological structure descriptor. We present
the extremal trees and unicyclic graphs with maximum and minimum eccentric
connectivity index subject to the certain graph constraints. Sharp lower and
asymptotic upper bound for all graphs are given and various connections with
other important graph invariants are established. In addition, we present
explicit formulae for the values of eccentric connectivity index for several
families of composite graphs and designed a linear algorithm for calculating
the eccentric connectivity index of trees. Some open problems and related
indices for further study are also listed.Comment: 25 pages, 5 figure
Laplacian coefficients of unicyclic graphs with the number of leaves and girth
Let be a graph of order and let be the characteristic polynomial of its
Laplacian matrix. Motivated by Ili\'{c} and Ili\'{c}'s conjecture [A. Ili\'{c},
M. Ili\'{c}, Laplacian coefficients of trees with given number of leaves or
vertices of degree two, Linear Algebra and its Applications
431(2009)2195-2202.] on all extremal graphs which minimize all the Laplacian
coefficients in the set of all -vertex unicyclic graphs
with the number of leaves , we investigate properties of the minimal
elements in the partial set of the Laplacian
coefficients, where denote the set of -vertex
unicyclic graphs with the number of leaves and girth . These results are
used to disprove their conjecture. Moreover, the graphs with minimum
Laplacian-like energy in are also studied.Comment: 19 page, 4figure
- …