Quasi‐random graphs with given degree sequences
From MaRDI portal
Publication:5436973
DOI10.1002/rsa.20188zbMath1130.05052OpenAlexW4241998900WikidataQ105583278 ScholiaQ105583278MaRDI QIDQ5436973
Ronald L. Graham, Fan R. K. Chung
Publication date: 18 January 2008
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20188
Related Items
Generalized modularity matrices, Regularity-based spectral clustering and mapping the Fiedler-carpet, Using discrepancy to control singular values for nonnegative matrices, Counting results for sparse pseudorandom hypergraphs. I., Counting results for sparse pseudorandom hypergraphs. II., An approximate version of Sidorenko's conjecture, On an anti-Ramsey threshold for random graphs, From quasirandom graphs to graph limits and graphlets, Matrix and discrepancy view of generalized random and quasirandom graphs, Extremal results in sparse pseudorandom graphs, Beyond the expanders, The idemetric property: when most distances are (almost) the same, Unnamed Item, On the Stability of Network Indices Defined by Means of Matrix Functions, Modularity spectra, eigen-subspaces, and structure of weighted graphs, Generalized quasirandom properties of expanding graph sequences, The poset of hypergraph quasirandomness, Compressive Sensing for Cut Improvement and Local Clustering, Relating multiway discrepancy and singular values of nonnegative rectangular matrices
Cites Work
