相关论文: On ABC spectral radius of uniform hypergraphs

For $0\leq \alpha < 1$, the $\mathcal{A}_{\alpha}$-spectral radius of a $k$-uniform hypergraph $G$ is defined to be the spectral radius of the tensor $\mathcal{A}_{\alpha}(G):=\alpha \mathcal{D}(G)+(1-\alpha) \mathcal{A}(G)$, where…

For $0\le\alpha<1$ and a uniform hypergraph $G$, the $\alpha$-spectral radius of $G$ is the largest $H$-eigenvalue of $\alpha \mathcal{D}(G) +(1-\alpha)\mathcal{A}(G)$, where $\mathcal{D}(G)$ and $\mathcal{A}(G)$ are the diagonal tensor of…

For a $hypergraph$ $\mathcal{G}=(V, E)$ consisting of a nonempty vertex set $V=V(\mathcal{G})$ and an edge set $E=E(\mathcal{G})$, its $adjacency$ $matrix$ $\mathcal {A}_{\mathcal{G}}=[(\mathcal {A}_{\mathcal{G}})_{ij}]$ is defined as…

In tensor eigenvalue problems, one is likely to be more interested in H-eigenvalues of tensors. The largest H-eigenvalue of a nonnegative tensor or of a uniform hypergraph is the spectral radius of the tensor or of the uniform hypergraph.…

The spectral radius of a uniform hypergraph $G$ is the the maximum modulus of the eigenvalues of the adjacency tensor of $G$. For $k\ge 2$, among connected $k$-uniform hypergraphs with $m\ge 1$ edges, we show that the $k$-uniform loose path…

Let $G$ be a $k$-uniform hypergraph with vertex set $V(G)$ and edge set $E(G)$. A connected and acyclic hypergraph is called a supertree. For $0\leq\alpha<1$, the $\alpha$-spectral radius of $G$ is the largest $H$-eigenvalue of $\alpha…

Let A(G) be the adjacency tensor (hypermatrix) of uniform hypergraph G. The maximum modulus of the eigenvalues of A(G) is called the spectral radius of G. In this paper, the conjecture of Fan et al. in [5] related to compare the spectral…

For a $hypergraph$ $\mathcal{G}=(V, E)$ consisting of a nonempty vertex set $V=V(\mathcal{G})$ and an edge set $E=E(\mathcal{G})$, its $adjacency$ $matrix$ $\mathcal {A}_{\mathcal{G}}=[(\mathcal {A}_{\mathcal{G}})_{ij}]$ is defined as…

For a $hypergraph$ $\mathcal{G}=(V, E)$ with a nonempty vertex set $V=V(\mathcal{G})$ and an edge set $E=E(\mathcal{G})$, its $adjacency$ $matrix$ $\mathcal {A}_{\mathcal{G}}=[(\mathcal {A}_{\mathcal{G}})_{ij}]$ is defined as $(\mathcal…

Let $G=(V,E)$ be a connected graph, where $V=\{v_1, v_2, \cdots, v_n\}$ and $m=|E|$. $d_i$ will denote the degree of vertex $v_i$ of $G$, and $\Delta=\max_{1\leq i \leq n} d_i$. The ABC matrix of $G$ is defined as $M(G)=(m_{ij})_{n \times…

The spectral radius of a uniform hypergraph is defined to be that of the adjacency tensor the hypergraph. It is known that the unique unicyclic hypergraph with the largest spectral radius is a nonlinear hypergraph, and the unique linear…

For real $\alpha\in [0,1)$ and a hypergraph $G$, the $\alpha$-spectral radius of $G$ is the largest eigenvalue of the matrix $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G)$, where $A(G)$ is the adjacency matrix of $G$, which is a symmetric…

In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic…

Let $G$ be an $r$-uniform hypergraph of order $t$ and $\rho(G)$ is the spectral radius of $\mathcal{A}(G)$, where $\mathcal{A}(G)$ is the adjacency tensor of $G$. A blow-up of $G$ respected to a positive integer vector $(n_{1},…

Let $G$ be a graph. We say that a hypergraph $H$ is a Berge-$G$ if there is a bijection $\phi: E(G)\to E(H)$ such that $e\subseteq \phi(e)$ for all $e\in E(G)$. For any $r$-uniform hypergraph $H$ and a real number $p\geq 1$, the…

Let $\mathbb{Q}_{k,n}$ be the set of the connected $k$-uniform weighted hypergraphs with $n$ vertices, where $k,n\geq 3$. For a hypergraph $G\in \mathbb{Q}_{k,n}$, let $\mathcal{A}(G)$, $\mathcal{L} (G)$ and $\mathcal{Q} (G)$ be its…

In this paper, we give some bounds for principal eigenvector and spectral radius of connected uniform hypergraphs in terms of vertex degrees, the diameter, and the number of vertices and edges.

The spectral analogue of the Tur\'{a}n type problem for hypergraphs is to determine the maximum spectral radius for the hypergraphs of order $n$ that do not contain a given hypergraph. For the hypergraphs among the set of the connected…

Let $G=(V,E)$ be a connected graph, where $V=\{v_1, v_2, \cdots, v_n\}$. Let $d_i$ denote the degree of vertex $v_i$. The ABC matrix of $G$ is defined as $M(G)=(m_{ij})_{n \times n}$, where $m_{ij}=\sqrt{(d_i + d_j -2)/(d_i d_j)}$ if $v_i…

A connected and acyclic hypergraph is called a supertree. In this paper we mainly focus on the spectral radii of uniform supertrees. Li, Shao and Qi determined the first two $k$-uniform supertrees with large spectral radii among all the…