A unified framework for the expander mixing lemma for irregular graphs and its applications

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Sharp spectral bounds of several graph parameters using eigenvector norms
A spectral excess theorem for nonregular graphs
Discrete norms of a matrix and the converse to the expander mixing lemma
Spectral bounds for the \(k\)-independence number of a graph
The Szemerédi-Trotter type theorem and the sum-product estimate in finite fields
Expansion in matrix-weighted graphs
Using discrepancy to control singular values for nonnegative matrices
Lifts, discrepancy and nearly optimal spectral gap
Explicit construction of linear sized tolerant networks
Eigenvalue interlacing and weight parameters of graphs
Grundy dominating sequences and zero forcing sets
Hermitian matrices and graphs: Singular values and discrepancy
Interlacing eigenvalues and graphs
Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
\(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs
On the zero forcing number and spectral radius of graphs
Toughness and normalized Laplacian eigenvalues of graphs
Routing number of dense and expanding graphs
On the \(k\)-independence number of graphs
A characterization and an application of weight-regular partitions of graphs
Zero forcing sets and the minimum rank of graphs
Graph toughness from Laplacian eigenvalues
Incidence bounds for block designs
Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes
Optimal Bounds for Matching Routing on Trees
Characterizing graphs of maximum principal ratio
The Zero Forcing Number of Graphs
Routing permutations on graphs via matchings
Bounds for the Greatest Latent Root of a Positive Matrix
On the algebraic theory of pseudo-distance-regularity around a set
Improved upper bounds on even-cycle creating Hamilton paths
Strong blocking sets and minimal codes from expander graphs

This page was built for publication: A unified framework for the expander mixing lemma for irregular graphs and its applications

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