Spectra of regular graphs and hypergraphs and orthogonal polynomials

DOI10.1006/EUJC.1996.0040MaRDI QIDQ1922874zbMATH OpenOpenAlexFDO

Authors Patrick Solé, Wen-Ching Winnie Li

Publication date 22 June 1997

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/eujc.1996.0040

zbMATH Keywords

Biggs graphsextremal eigenvaluesHecke operatorshypergraphsorthogonal polynomialsregular bigraphsregular graphsspectrum

Mathematics Subject Classification ID

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

Recommendations

• Spectra of hypergraphs and applications
• The second eigenvalue of regular graphs of given girth
• On the spectrum and linear programming bound for hypergraphs
• Spectra of random regular hypergraphs
• scientific article; zbMATH DE number 2144607

Cited in

(37)

• Investigation of binary spectra by explicit polynomial transformations of graphs
• The alternating polynomials and their relation with the spectra and conditional diameters of graphs
• Some applications of the proper and adjacency polynomials in the theory of graph spectra
• The finite upper half space and related hypergraphs
• A continuous analogue of the girth problem
• The semicircle law for semiregular bipartite graphs
• Spectra of hypergraphs and applications
• Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
• Spectra of random regular hypergraphs
• On the spectrum and linear programming bound for hypergraphs
• A connection between a question of Bermond and Bollobás and Ramanujan graphs
• A spectral version of the Moore problem for bipartite regular graphs
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Spectral radius of uniform hypergraphs
• On the sizes of expander graphs and minimum distances of graph codes
• On the extreme eigenvalues of regular graphs.
• Some Ramanujan hypergraphs associated to GL\((n,\mathbb{F}_q)\)
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• Random matrices, nonbacktracking walks, and orthogonal polynomials
• A reductive approach to hypergraph clustering: an application to image segmentation
• Regular graphs. A spectral approach
• The Lovász theta function for random regular graphs and community detection in the hard regime
• Spectral gap in random bipartite biregular graphs and applications
• Global eigenvalue fluctuations of random biregular bipartite graphs
• Generalizing p-Laplacian: spectral hypergraph theory and a partitioning algorithm
• On the second eigenvalue of random bipartite biregular graphs
• Explicit non-malleable codes from bipartite graphs
• Artin-Ihara L-functions for hypergraphs
• Scalable tensor methods for nonuniform hypergraphs
• Sparse random hypergraphs: non-backtracking spectra and community detection
• On the Q-spread of regular uniform hypergraphs
• Random Schreier graphs as expanders
• Average-case optimization analysis for distributed consensus algorithms on regular graphs
• Title not available (Why is no real title available?)
• The second eigenvalue of regular graphs of given girth
• Zeta functions of finite graphs and coverings. III
• On quantum percolation in finite regular graphs

This page was built for publication: Spectra of regular graphs and hypergraphs and orthogonal polynomials

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