49 research outputs found
On the maximum -spectral radius of unicyclic and bicyclic graphs with fixed girth or fixed number of pendant vertices
For a connected graph , let be the adjacency matrix of and
be the diagonal matrix of the degrees of the vertices in . The
-matrix of is defined as \begin{align*} A_\alpha (G) = \alpha
D(G) + (1-\alpha) A(G) \quad \text{for any }. \end{align*}
The largest eigenvalue of is called the -spectral
radius of . In this article, we characterize the graphs with maximum
-spectral radius among the class of unicyclic and bicyclic graphs
of order with fixed girth . Also, we identify the unique graphs with
maximum -spectral radius among the class of unicyclic and bicyclic
graphs of order with pendant vertices.Comment: 16 page
The inertia of weighted unicyclic graphs
Let be a weighted graph. The \textit{inertia} of is the triple
, where
are the number of the positive, negative and zero
eigenvalues of the adjacency matrix of including their
multiplicities, respectively. , is called the
\textit{positive, negative index of inertia} of , respectively. In this
paper we present a lower bound for the positive, negative index of weighted
unicyclic graphs of order with fixed girth and characterize all weighted
unicyclic graphs attaining this lower bound. Moreover, we characterize the
weighted unicyclic graphs of order with two positive, two negative and at
least zero eigenvalues, respectively.Comment: 23 pages, 8figure
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 spectral properties of signed circular caterpillars
A circular caterpillar of girth n is a graph such that the removal of all pendant vertices yields a cycle Cn of order n. A signed graph is a pair Γ = (G, σ), where G is a simple graph and σ ∶ E(G) → {+1, −1} is the sign function defined on the set E(G) of edges of G. The signed graph Γ is said to be balanced if the number of negatively signed edges in each cycle is even, and it is said to be unbalanced otherwise. We determine some bounds for the first n Laplacian eigenvalues of any signed circular caterpillar. As an application, we prove that each signed spiked triangle (G(3; p, q, r), σ), i. e. a signed circular caterpillar of girth 3 and degree sequence πp,q,r = (p + 2, q + 2, r + 2, 1,..., 1), is determined by its Laplacian spectrum up to switching isomorphism. Moreover, in the set of signed spiked triangles of order N, we identify the extremal graphs with respect to the Laplacian spectral radius and the first two Zagreb indices. It turns out that the unbalanced spiked triangle with degree sequence πN−3,0,0 and the balanced spike triangle (G(3; p, ^ q, ^ r^), +), where each pair in {p, ^ q, ^ r^} differs at most by 1, respectively maximizes and minimizes the Laplacian spectral radius and both the Zagreb indices
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