The proof of a conjecture on largest Laplacian and signless Laplacian H-eigenvalues of uniform hypergraphs

preprint2015arXivOpen access

Abstract

Let A(G),L(G)\mathcal{A(}G\mathcal{)},\mathcal{L(}G\mathcal{)} and Q(\mathcal{Q(}% G\mathcal{)} be the adjacency tensor, Laplacian tensor and signless Laplacian tensor of uniform hypergraph GG, respectively. Denote by λ(T)λ(\mathcal{T}) the largest H-eigenvalue of tensor T\mathcal{T}. Let HH be a uniform hypergraph, and H′H^{\prime} be obtained from HH by inserting a new vertex with degree one in each edge. We prove that λ(Q(λ(\mathcal{Q(}% H^{\prime}\mathcal{)})\leqλ(\mathcal{Q(}H\mathcal{)}). Denote by GkG^{k} the kkth power hypergraph of an ordinary graph GG with maximum degree Δ≥2Δ\geq2. We will prove that {λ(Q(\{λ(\mathcal{Q(}% G^{k}\mathcal{)})\} is a strictly decreasing sequence, which imply Conjectrue 4.1 of Hu, Qi and Shao in \cite{HuQiShao2013}. We also prove that λ(Q(Gk))λ(\mathcal{Q(}G^{k}\mathcal{)}) converges to ΔΔ when kk goes to infinity. The definiton of kkth power hypergraph GkG^{k} has been generalized as Gk,s.G^{k,s}. We also prove some eigenvalues properties about A(\mathcal{A(}% G^{k,s}\mathcal{)}, which generalize some known results. Some related results about L(G)\mathcal{L(}G\mathcal{)} are also mentioned.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.