Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/43864
Title: The proof of a conjecture on largest Laplacian and signless Laplacian H-eigenvalues of uniform hypergraphs
Authors: Yuan, X
Qi, L 
Shao, J
Keywords: 05C50
MSC 15A42
Issue Date: 2016
Publisher: North-Holland
Source: Linear algebra and its applications, 2016, v. 490, p. 18-30 How to cite?
Journal: Linear algebra and its applications 
Abstract: Let A(G),L(G) and Q(G) be the adjacency tensor, Laplacian tensor and signless Laplacian tensor of uniform hypergraph G, respectively. Denote by λ(T) the largest H-eigenvalue of tensor T. Let H be a uniform hypergraph, and H′ be obtained from H by inserting a new vertex with degree one in each edge. We prove that λ(Q(H′)) (Q(H)). Denote by ;bsupesup the kth power hypergraph of an ordinary graph G with maximum degree Δ>2. We prove that {λ(Q(;bsupesup))} is a strictly decreasing sequence, which implies Conjecture 4.1 of Hu, Qi and Shao in [4]. We also prove that λ(Q(;bsupesup)) converges to Δ when k goes to infinity. The definition of kth power hypergraph ;bsupesup has been generalized as ;bsupesup We also prove some eigenvalues properties about A(;bsupesup), which generalize some known results. Some related results about L(G) are also mentioned.
URI: http://hdl.handle.net/10397/43864
ISSN: 0024-3795
DOI: 10.1016/j.laa.2015.10.013
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

2
Last Week
0
Last month
Citations as of Jul 21, 2017

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
Citations as of Jul 18, 2017

Page view(s)

17
Last Week
2
Last month
Checked on Jul 9, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.