42 research outputs found

    Some results on extremal spectral radius of hypergraph

    Full text link
    For a hypergraphhypergraph G=(V,E)\mathcal{G}=(V, E) with a nonempty vertex set V=V(G)V=V(\mathcal{G}) and an edge set E=E(G)E=E(\mathcal{G}), its adjacencyadjacency matrixmatrix AG=[(AG)ij]\mathcal {A}_{\mathcal{G}}=[(\mathcal {A}_{\mathcal{G}})_{ij}] is defined as (AG)ij=βˆ‘e∈Eij1∣eβˆ£βˆ’1(\mathcal {A}_{\mathcal{G}})_{ij}=\sum_{e\in E_{ij}}\frac{1}{|e| - 1}, where Eij={e∈Eβ€‰βˆ£β€‰i,j∈e}E_{ij} = \{e\in E\, |\, i, j \in e\}. The spectralspectral radiusradius of a hypergraph G\mathcal{G}, denoted by ρ(G)\rho(\mathcal {G}), is the maximum modulus among all eigenvalues of AG\mathcal {A}_{\mathcal{G}}. 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 kk-uniform (kβ‰₯3k\geq 3) unicyclic hypergraphs with fixed number of vertices, the hypergraphs with the minimum, the second the minimum spectral radius are completely determined, respectively; among all kk-uniform (kβ‰₯3k\geq 3) unicyclic hypergraphs with fixed number of vertices and fixed girth, the hypergraphs with the maximum spectral radius are completely determined; among all kk-uniform (kβ‰₯3k\geq 3) octopuslikeoctopuslike hypergraphs with fixed number of vertices, the hypergraphs with the minimum spectral radius are completely determined. As well, for kk-uniform (kβ‰₯3k\geq 3) lollipoplollipop 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 AΞ±A_{\alpha}-spectral radius of unicyclic and bicyclic graphs with fixed girth or fixed number of pendant vertices

    Full text link
    For a connected graph GG, let A(G)A(G) be the adjacency matrix of GG and D(G)D(G) be the diagonal matrix of the degrees of the vertices in GG. The AαA_{\alpha}-matrix of GG is defined as \begin{align*} A_\alpha (G) = \alpha D(G) + (1-\alpha) A(G) \quad \text{for any α∈[0,1]\alpha \in [0,1]}. \end{align*} The largest eigenvalue of Aα(G)A_{\alpha}(G) is called the AαA_{\alpha}-spectral radius of GG. In this article, we characterize the graphs with maximum AαA_{\alpha}-spectral radius among the class of unicyclic and bicyclic graphs of order nn with fixed girth gg. Also, we identify the unique graphs with maximum AαA_{\alpha}-spectral radius among the class of unicyclic and bicyclic graphs of order nn with kk pendant vertices.Comment: 16 page
    corecore