Abstract
Let and be the adjacency tensor, Laplacian tensor and signless Laplacian tensor of uniform hypergraph , respectively. Denote by the largest H-eigenvalue of tensor . Let be a uniform hypergraph, and be obtained from by inserting a new vertex with degree one in each edge. We prove that Denote by the th power hypergraph of an ordinary graph with maximum degree . We will prove that is a strictly decreasing sequence, which imply Conjectrue 4.1 of Hu, Qi and Shao in \cite{HuQiShao2013}. We also prove that converges to when goes to infinity. The definiton of th power hypergraph has been generalized as We also prove some eigenvalues properties about which generalize some known results. Some related results about are also mentioned.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.