中文
相关论文

相关论文: Largest and Least H-Eigenvalues of Symmetric Tenso…

200 篇论文

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…

组合数学 · 数学 2018-07-24 HaiYan Guo , Bo Zhou

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…

组合数学 · 数学 2022-03-01 Rui Sun , Wen-Huan Wang

Let $\mathcal{A}(H)$ be the adjacency tensor of $r$-uniform hypergraph $H$. If $H$ is connected, the unique positive eigenvector $x=(x_1,x_2,\ldots,x_n)^{\mathrm{T}}$ with $||x||_r=1$ corresponding to spectral radius $\rho(H)$ is called the…

组合数学 · 数学 2017-01-17 Lele Liu , Liying Kang , Xiying Yuan

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…

组合数学 · 数学 2016-05-09 Liying Kang , Lele Liu , Liqun Qi , Xiying Yuan

We study both $H$ and $E/Z$-eigenvalues of the adjacency tensor of a uniform multi-hypergraph and give conditions for which the largest positive $H$ or $Z$-eigenvalue corresponds to a strictly positive eigenvector. We also investigate when…

谱理论 · 数学 2012-09-26 Kelly J. Pearson , Tan Zhang

Given a $k$-uniform hypergraph $G$ with vertex set $[n]$ and edge set $E(G)$, the ABC tensor $\mathcal{ABC}(G)$ of $G$ is the $k$-order $n$-dimensional tensor with \[ \mathcal{ABC}(G)_{i_1, \dots, i_k}= \begin{cases}…

组合数学 · 数学 2023-03-29 Hongying Lin , Bo Zhou

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…

离散数学 · 计算机科学 2023-03-30 Haiyan Guo , Bo Zhou , Bizhu Lin

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…

谱理论 · 数学 2018-08-28 Jianbin Zhang , Jianping Li , Haiyan Guo

Let $\mathcal{H}$ be a uniform hypergraph. Let $\mathcal{A(H)}$ and $\mathcal{Q(H)}$ be the adjacency tensor and the signless Laplacian tensor of $\mathcal{H}$, respectively. In this note we prove several bounds for the spectral radius of…

组合数学 · 数学 2015-02-24 Xiying Yuan , Man Zhang , Mei Lu

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…

组合数学 · 数学 2021-09-09 Peng-Li Zhang , Xiao-Dong Zhang

Let $G$ be a connected uniform hypergraphs with maximum degree $\Delta$, spectral radius $\lambda$ and minimum H-eigenvalue $\mu$. In this paper, we give some lower bounds for $\Delta-\lambda$, which extend the result of [S.M. Cioab\u{a},…

组合数学 · 数学 2015-12-01 Jiang Zhou , Lizhu Sun , Changjiang Bu

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…

组合数学 · 数学 2022-06-08 Chang Liu , Jianping Li

In this paper, we show that the largest Laplacian H-eigenvalue of a $k$-uniform nontrivial hypergraph is strictly larger than the maximum degree when $k$ is even. A tight lower bound for this eigenvalue is given. For a connected…

谱理论 · 数学 2013-05-14 Shenglong Hu , Liqun Qi , Jinshan Xie

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.

组合数学 · 数学 2016-05-30 Haifeng Li , Jiang Zhou , Changjiang Bu

Let $G$ be a connected hypergraph with even uniformity, which contains cut vertices. Then $G$ is the coalescence of two nontrivial connected sub-hypergraphs (called branches) at a cut vertex. Let $\mathcal{A}(G)$ be the adjacency tensor of…

组合数学 · 数学 2021-08-31 Yi-Zheng Fan , Zhu Zhu , Yi Wang

For a nonnegative symmetric weakly irreducible tensor, its spectral radius is an eigenvalue corresponding to a unique positive eigenvector up to a scalar called the Perron vector. But including the Perron vector, there may have more than…

组合数学 · 数学 2019-02-15 Yi-Zheng Fan , Yan-Hong Bao , Tao Huang

We propose a simple and natural definition for the Laplacian and the signless Laplacian tensors of a uniform hypergraph. We study their H$^+$-eigenvalues, i.e., H-eigenvalues with nonnegative H-eigenvectors, and H$^{++}$-eigenvalues, i.e.,…

谱理论 · 数学 2013-07-09 Liqun Qi

Let $\mathcal{A}(H)$ and $\mathcal{Q}(H)$ be the adjacency tensor and signless Laplacian tensor of an $r$-uniform hypergraph $H$. Denote by $\rho(H)$ and $\rho(\mathcal{Q}(H))$ the spectral radii of $\mathcal{A}(H)$ and $\mathcal{Q}(H)$,…

谱理论 · 数学 2016-11-23 Lele Liu , Liying Kang , Erfang Shan

Unlike an irreducible $Z$-matrices, a weakly irreducible $Z$-tensor $\mathcal{A}$ can have more than one eigenvector associated with the least H-eigenvalue. We show that there are finitely many eigenvectors of $\mathcal{A}$ associated with…

组合数学 · 数学 2019-01-25 Yi-Zheng Fan , Yi Wang , Yan-Hong Bao

Let $spex(n,H_{minor})$ denote the maximum spectral radius of $n$-vertex $H$-minor free graphs. The problem on determining this extremal value can be dated back to the early 1990s. Up to now, it has been solved for $n$ sufficiently large…

组合数学 · 数学 2026-03-23 Mingqing Zhai , Longfei Fang , Huiqiu Lin
‹ 上一页 1 2 3 10 下一页 ›