Eigenvalues and expansion of bipartite graphs

DOI10.1007/S10623-011-9598-6MaRDI QIDQ690667zbMATHOpenAlexFDO

Authors Tom Høholdt, Heeralal Janwa

Publication date 28 November 2012

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://orbit.dtu.dk/en/publications/83aaf771-5fc6-4797-b51d-df6f3b8b3255

zbMATH Keywords

eigenvalues of graphsisoperimetric constantbipartite graphsexpander graphsLDPC codesBIBD'sbipartite Ramanujan graphsgeneralized N-gons

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of block designs (05B05) Eulerian and Hamiltonian graphs (05C45) Applications of design theory to circuits and networks (94C30)

Recommendations

• Eigenvalues and expanders
• Publication:3201100
• The second largest eigenvalues of regular bipartite graphs
• Publication:4230352
• Bounds for eigenvalues of a graph

Cites work

• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 47926 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1849959 (Why is no real title available?)
• scientific article; zbMATH DE number 2115090 (Why is no real title available?)
• Character sums and abelian Ramanujan graphs (with an appendix by Keqin Feng and Wen-Ch'ing Winnie Li)
• Codes on graphs: Recent progress
• Error exponents of expander codes
• Expander codes
• Expander graphs and their applications
• Explicit Concentrators from Generalized N-Gons
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• Explicit construction of graphs with an arbitrary large girth and of large size
• Explicit construction of linear sized tolerant networks
• Finite generalized quadrangles
• Linear-time encodable and decodable error-correcting codes
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Minimum-distance bounds by graph analysis
• On Tanner codes: Minimum distance and decoding
• On expander codes
• On the Dimensions of Certain LDPC Codes Based on$q$-Regular Bipartite Graphs
• Optimal bipartite Ramanujan graphs from balanced incomplete block designs: their characterizations and applications to expander/LDPC codes
• Ramanujan graphs on cosets of \(\operatorname{PGL}_2(\mathbb F_q)\)
• Some elementary Ramanujan graphs
• Some low-density parity-check codes derived from finite geometries
• The dimensions of \(LU(3,q)\) codes

Cited in

(15)

• Explicit non-malleable codes from bipartite graphs
• A spectral version of the Moore problem for bipartite regular graphs
• Expanders obtained from affine transformations
• Spectral gap in random bipartite biregular graphs and applications
• Expansion in matrix-weighted graphs
• scientific article; zbMATH DE number 7404405 (Why is no real title available?)
• Bicliques and eigenvalues
• Eigenvalues and expanders
• scientific article; zbMATH DE number 4177110 (Why is no real title available?)
• The vertex-isoperimetric number of the incidence and non-incidence graphs of unitals
• Monotonic normalized heat diffusion for regular bipartite graphs with four eigenvalues
• On the sizes of expander graphs and minimum distances of graph codes
• On the bipartiteness constant and expansion of Cayley graphs
• Bipartite density of cubic graphs: The case of equality
• Expansion properties of Levi graphs.

This page was built for publication: Eigenvalues and expansion of bipartite graphs

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