42 research outputs found
Some results on extremal spectral radius of hypergraph
For a with a nonempty vertex set
and an edge set , its
is defined as
, where
. The of a hypergraph
, denoted by , is the maximum modulus among
all eigenvalues of . In this paper, we get a
formula about the spectral radius which link the ordinary graph and the
hypergraph, and represent some results on the spectral radius changing under
some graphic structural perturbations. Among all -uniform ()
unicyclic hypergraphs with fixed number of vertices, the hypergraphs with the
minimum, the second the minimum spectral radius are completely determined,
respectively; among all -uniform () unicyclic hypergraphs with
fixed number of vertices and fixed girth, the hypergraphs with the maximum
spectral radius are completely determined; among all -uniform ()
hypergraphs with fixed number of vertices, the hypergraphs with
the minimum spectral radius are completely determined. As well, for -uniform
() hypergraphs, we get that the spectral radius decreases
with the girth increasing.Comment: arXiv admin note: substantial text overlap with arXiv:2306.10184,
arXiv:2306.1602
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