H^+-eigenvalues of Laplacian and signless Laplacian tensors

DOI10.4310/CMS.2014.V12.N6.A3MaRDI QIDQ482264zbMATH OpenOpenAlexFDO

Authors Liqun Qi

Publication date 22 December 2014

Published in Communications in Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1303.2186

zbMATH Keywords

signless Laplacian tensoruniform hypergraphLaplacian tensor\(H^{+}\)-eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Hypergraphs (05C65)

Abstract: 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., H-eigenvalues with positive H-eigenvectors. We show that each of the Laplacian tensor, the signless Laplacian tensor and the adjacency tensor has at most one H${}^{++}$-eigenvalue, but has several other H${}^{+}$-eigenvalues. We identify their largest and smallest H${}^{+}$-eigenvalues, and establish some maximum and minimum properties of these H${}^{+}$-eigenvalues. We then define analytic connectivity of a uniform hypergraph and discuss its application in edge connectivity.

Recommendations

• H-eigenvalues of signless Laplacian tensor for an even uniform hypergraph
• Some properties of the signless Laplacian and normalized Laplacian tensors of general hypergraphs
• On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph
• The Laplacian of a uniform hypergraph
• The Laplacian tensor of a multi-hypergraph

Cited in

(only showing first 100 items - show all)

• A reduction formula for the Laplacian characteristic polynomial of a uniform hypertree
• Circulant tensors with applications to spectral hypergraph theory and stochastic process
• On the conjecture of the \(r\)-uniform supertrees with the eight largest \(\alpha\)-spectral radii
• Finding all \(H\)-eigenvalues of signless Laplacian tensor for a uniform loose path of length three
• H-eigenvalues of signless Laplacian tensor for an even uniform hypergraph
• Spectral properties of odd-bipartite \(Z\)-tensors and their absolute tensors
• Sharp bounds for ordinary and signless Laplacian spectral radii of uniform hypergraphs
• \(p\)-norm \(B\)-tensors and \(p\)-norm \(B_0\)-tensors
• The maximum -spectral radius and the majorization theorem of k-uniform supertrees
• An adaptive cubic regularization algorithm for computing H- and Z-eigenvalues of real even-order supersymmetric tensors
• Pareto H-eigenvalues of nonnegative tensors and uniform hypergraphs
• A necessary and sufficient condition for existence of a positive Perron vector
• Spectral properties of general hypergraphs
• Upper bounds for signless Laplacian Z-spectral radius of uniform hypergraphs
• Sharp bounds for the signless Laplacian spectral radius of uniform hypergraphs
• The Laplacian of a uniform hypergraph
• The zero eigenvalue of the Laplacian tensor of a uniform hypergraph
• Column sufficient tensors and tensor complementarity problems
• Laplacian and signless Laplacian Z-eigenvalues of uniform hypergraphs
• Largest adjacency, signless Laplacian, and Laplacian H-eigenvalues of loose paths
• Lower bounds for the \(\mathcal{A}_\alpha\)-spectral radius of uniform hypergraphs
• Some properties of the signless Laplacian and normalized Laplacian tensors of general hypergraphs
• Spectra of weighted uniform hypertrees
• The adjacency and signless Laplacian spectra of cored hypergraphs and power hypergraphs
• Eigenvectors of Laplacian or signless Laplacian of hypergraphs associated with zero eigenvalue
• The characteristic polynomials of uniform hypercycles with length four
• Largest signless Laplacian spectral radius of uniform supertrees with diameter and pendent edges (vertices)
• E-cospectral hypergraphs and some hypergraphs determined by their spectra
• The \(H\)-spectra of a class of generalized power hypergraphs
• Bounds on the spectral radius of general hypergraphs in terms of clique number
• Developments on the Hoffman program of graphs
• Symmetry of eigenvalues of Sylvester matrices and tensors
• The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
• A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
• Eigenvalue analysis of constrained minimization problem for homogeneous polynomial
• A family of gradient methods using Householder transformation with application to hypergraph partitioning
• Characterizations of the spectral radius of nonnegative weakly irreducible tensors via a digraph
• On the iterative criterion for strong \(\mathcal{H}\)-tensors
• Some properties on -least eigenvalue of uniform hypergraphs and their applications
• On the -spectral radius of the k-uniform supertrees
• The \(\alpha \)-spectral radius of general hypergraphs
• Sharp bounds for the spectral radii of nonnegative tensors
• The \(\alpha \)-spectral radius of \(f\)-connected general hypergraphs
• The largest H-eigenvalue and spectral radius of Laplacian tensor of non-odd-bipartite generalized power hypergraphs
• Signed k-uniform hypergraphs and tensors
• The proof of a conjecture on largest Laplacian and signless Laplacian H-eigenvalues of uniform hypergraphs
• Strictly semi-positive tensors and the boundedness of tensor complementarity problems
• Inverse Perron values and connectivity of a uniform hypergraph
• \({\mathcal{C}}^k_{m,s}\) as a \(k\)-uniform hypergraph and some its properties
• On the irregularity of uniform hypergraphs
• Further results on \(B\)-tensors with application to location of real eigenvalues
• On computing minimal \(H\)-eigenvalue of sign-structured tensors
• Spectral radius of uniform hypergraphs and degree sequences
• On the \(\alpha \)-spectral radius of uniform hypergraphs
• The Fiedler vector of a Laplacian tensor for hypergraph partitioning
• The least H-eigenvalue of signless Laplacian of non-odd-bipartite hypergraphs
• Primitive tensors and directed hypergraphs
• Some spectral properties of uniform hypergraphs
• Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations
• Spectra of general hypergraphs
• A general result on the spectral radii of nonnegative \(k\)-uniform tensors
• Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs
• Some note on a positive tensor and its Hadamard powers eigenvalue
• On the \(\alpha\)-spectral radius of irregular uniform hypergraphs
• On Best Low Rank Approximation of Positive Definite Tensors
• Characterizing upper bounds of Z-spectral radius of uniform hypergraphs
• The Laplacian spectral moments of uniform hypergraphs
• On the spectral radius of uniform weighted hypergraph
• A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs
• On some properties of the \(\alpha \)-spectral radius of the \(k\)-uniform hypergraph
• \(\mathrm{P}\)-tensors, \(\mathrm{P}_0\)-tensors, and their applications
• Some properties of the Laplace and normalized Laplace spectra of uniform hypergraphs
• Sombor Index of Hypergraphs
• Sharp bounds for spectral radius of nonnegative weakly irreducible tensors
• Algebraic connectivity of an even uniform hypergraph
• The extremal spectral radii of k-uniform supertrees
• On the Perron–Frobenius theory for tensors with negative entries and its applications
• Generalizing p-Laplacian: spectral hypergraph theory and a partitioning algorithm
• Bounds on the spectral radius of uniform hypergraphs
• Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
• The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs
• Computing eigenvalues of large scale sparse tensors arising from a hypergraph
• On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
• Adjacency spectra of random and complete hypergraphs
• The Laplacian tensor of a multi-hypergraph
• \(M\)-tensors and nonsingular \(M\)-tensors
• On the spectral radius of uniform hypertrees
• On spectral theory of a k-uniform directed hypergraph
• New iterative schemes for identifying strong \(\mathcal{H}\)-tensors and their applications
• Some upper bounds on the eigenvalues of uniform hypergraphs
• Properties of some classes of structured tensors
• Several bounds on the spectral radius of uniform hypergraphs
• The spectra of uniform hypertrees
• An even order symmetric \(B\) tensor is positive definite
• Even order uniform hypergraph via the Einstein product
• Computing all Laplacian H-eigenvalues for a uniform loose path of length three
• The geometry connectivity of hypergraphs
• Positive definiteness and semi-definiteness of even order symmetric Cauchy tensors
• All eigenvalues of the power hypergraph and signed subgraphs of a graph
• The abstract Laplacian tensor of a hypergraph with applications in clustering

This page was built for publication: \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482264)