55 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
On the -spectral radius of hypergraphs
For real and a hypergraph , the -spectral radius
of is the largest eigenvalue of the matrix , where is the adjacency matrix of , which is a
symmetric matrix with zero diagonal such that for distinct vertices of
, the -entry of is exactly the number of edges containing both
and , and is the diagonal matrix of row sums of . We study
the -spectral radius of a hypergraph that is uniform or not necessarily
uniform. We propose some local grafting operations that increase or decrease
the -spectral radius of a hypergraph. We determine the unique
hypergraphs with maximum -spectral radius among -uniform hypertrees,
among -uniform unicyclic hypergraphs, and among -uniform hypergraphs with
fixed number of pendant edges. We also determine the unique hypertrees with
maximum -spectral radius among hypertrees with given number of vertices
and edges, the unique hypertrees with the first three largest (two smallest,
respectively) -spectral radii among hypertrees with given number of
vertices, the unique hypertrees with minimum -spectral radius among the
hypertrees that are not -uniform, the unique hypergraphs with the first two
largest (smallest, respectively) -spectral radii among unicyclic
hypergraphs with given number of vertices, and the unique hypergraphs with
maximum -spectral radius among hypergraphs with fixed number of pendant
edges
- …