On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs

DOI10.1080/03081080290011692zbMath1008.05102OpenAlexW2066639978WikidataQ57974537 ScholiaQ57974537MaRDI QIDQ4542164

Juan Alberto Rodríguez-Velázquez

Publication date: 2 April 2003

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081080290011692

Mathematics Subject Classification ID

Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (25)

Spectral radius of uniform hypergraphs ⋮ Core-Periphery Detection in Hypergraphs ⋮ A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs ⋮ Unnamed Item ⋮ Algebraic degree of spectra of Cayley hypergraphs ⋮ Adjacency energy of hypergraphs ⋮ The signless Laplacian matrix of hypergraphs ⋮ An averaging process on hypergraphs ⋮ Generalizing \(p\)-Laplacian: spectral hypergraph theory and a partitioning algorithm ⋮ Unnamed Item ⋮ Some properties on eccentricity matrices of uniform hypertrees ⋮ Some bounds on spectral radius of signless Laplacian matrix of k-graphs ⋮ The structure and dynamics of networks with higher order interactions ⋮ Joins of hypergraphs and their spectra ⋮ The spectral property of hypergraph coverings ⋮ Unnamed Item ⋮ On the spectrum of hypergraphs ⋮ The stabilizing index and cyclic index of the coalescence and Cartesian product of uniform hypergraphs ⋮ Principal eigenvector of the signless Laplacian matrix ⋮ The \((\alpha ,\beta ,s,t)\)-diameter of graphs: a particular case of conditional diameter ⋮ Principal eigenvectors of general hypergraphs ⋮ Some bounds for the incidence \(Q\)-spectral radius of uniform hypergraphs ⋮ Laplacian eigenvalues and partition problems in hypergraphs ⋮ Adjacency spectra of random and complete hypergraphs ⋮ Spectra of cycle and path families of oriented hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Locally pseudo-distance-regular graphs
• Girth, valency, and excess
• Diameter, covering index, covering radius and eigenvalues
• Eigenvalues, diameter, and mean distance in graphs
• The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
• Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods
• Spectral diameter estimates for \(k\)-regular graphs
• The alternating polynomials and their relation with the spectra and conditional diameters of graphs
• Eigenvalues, eigenspaces and distances to subsets
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Interlacing eigenvalues and graphs
• On a class of polynomials and its relation with the spectra and diameters of graphs
• Isoperimetric numbers of graphs
• From regular boundary graphs to antipodal distance-regular graphs
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
• Developments in the theory of graph spectra
• Eigenvalues and the diameter of graphs
• On the algebraic theory of pseudo-distance-regularity around a set

This page was built for publication: On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs