Diameters and Eigenvalues
From MaRDI portal
Recommendations
Cites work
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- An Estimate for Character Sums
- Asymptotically optimal switching circuits
- Asymptotically tight bounds on time-space trade-offs in a pebble game
- Better expanders and superconcentrators
- Correction to “Space Bounds for a Game on Graphs” by Wolfgang J. Paul, Robert Endre Tarjan and James R. Celoni
- Cycles of even length in graphs
- Diameters of weighted double loop networks
- Eigenvalues and expanders
- Equations over finite fields. An elementary approach
- Expanders and Diffusers
- Expanders obtained from affine transformations
- Expanding graphs contain all small trees
- Explicit Concentrators from Generalized N-Gons
- Explicit constructions of linear-sized superconcentrators
- Graph-theoretic properties in computational complexity
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- scientific article; zbMATH DE number 3487716 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- Intersection theorems with geometric consequences
- Minimal Regular Graphs of Girths Eight and Twelve
- On a class of degenerate extremal graph problems
- On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
- On Graphs that do not Contain a Thomsen Graph
- On Minimal graphs of maximum even girth
- On size Ramsey number of paths, trees, and circuits. I
- Ramanujan graphs
- Sorting in \(c \log n\) parallel steps
- Superconcentrators
- Theorems in the additive theory of numbers
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits
Cited in
(only showing first 100 items - show all)- Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes
- Diameter, covering index, covering radius and eigenvalues
- Eigenvalues, diameter, and mean distance in graphs
- The symbiotic relationship of combinatorics and matrix theory
- Some geometric aspects of graphs and their eigenfunctions
- The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
- Polynomial factorisation and an application to regular directed graphs
- On the spectra of certain graphs arising from finite fields
- Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods
- On the spectrum, the growth, and the diameter of a graph
- Laplacian matrices of graphs: A survey
- Hash functions and Cayley graphs
- The alternating polynomials and their relation with the spectra and conditional diameters of graphs
- Eigenvalues, eigenspaces and distances to subsets
- Finite fields and Ramanujan graphs
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- Boundary graphs. II: The limit case of a spectral property
- Character sums, primitive elements, and powers in finite fields
- Factor base discrete logarithms in Kummer extensions
- Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
- Multidiameters and multiplicities
- Some graphs with small second eigenvalue
- On the second eigenvalue of hypergraphs
- Graph spectra for finite upper half planes over rings
- Nonabelian sets with distinct k-sums
- Direct scaling analysis of localization in single-particle quantum systems on graphs with diagonal disorder
- Ultrametric subsets with large Hausdorff dimension
- A natural graph of finite fields distinguishing between models
- A Cheeger type inequality in finite Cayley sum graphs
- Regular Turán numbers of complete bipartite graphs
- Perfect codes in Cayley sum graphs
- On the Laplacian spectrum of k-uniform hypergraphs
- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
- Markov chains on finite fields with deterministic jumps
- Eigenvalues of Cayley graphs
- On the spectrum of hypergraphs
- From fixed-energy localization analysis to dynamical localization: an elementary path
- A spectral version of the Moore problem for bipartite regular graphs
- Approximate Moore graphs are good expanders
- On integral Cayley sum graphs
- Algebraic Cayley graphs over finite local rings
- Generating sets for the multiplicative groups of algebras over finite fields and expander graphs
- Dirichlet problem on locally finite graphs
- On the spectra of hypertrees
- Some results on diameters of Cayley graphs
- Connectivity of addition Cayley graphs
- On random random walks
- An eigenvalue bound for the Laplacian of a graph
- Laplacian spectral bounds for clique and independence numbers of graphs
- Energy bounds, bilinear forms and their applications in function fields
- Cayley sum graphs and their applications to codebooks
- Orthogonal polarity graphs and Sidon sets
- Evolutionary escape on complex genotype-phenotype networks
- Isoperimetric Inequalities and Eigenvalues
- scientific article; zbMATH DE number 1000519 (Why is no real title available?)
- Loose Laplacian spectra of random hypergraphs
- Integral Cayley sum graphs and groups
- Cutoff on all Ramanujan graphs
- The Connectivity of addition Cayley graphs
- Expander graphs and gaps between primes
- Some things we've learned (about Markov chain Monte Carlo)
- An Estimate for Character Sums
- scientific article; zbMATH DE number 26331 (Why is no real title available?)
- Algebraic Cayley graphs over finite fields
- Generators and irreducible polynomials over finite fields
- Diameters, distortion, and eigenvalues
- The diameter of dense random regular graphs
- Ramanujan graphs and Hecke operators
- Quasi-Random Set Systems
- Cayley sum color and anti-circulant graphs
- Eigenvalue ratios of non-negatively curved graphs
- On the expansion of group-based lifts
- A two-sided error distributed property tester for conductance
- On middle cube graphs
- Unit and unitary Cayley graphs for the ring of Eisenstein integers modulo \(n\)
- Unitary Addition Cayley Ring Signed Graphs *
- scientific article; zbMATH DE number 7268671 (Why is no real title available?)
- Bound on the diameter of metacyclic groups
- On the expansion of group-based lifts
- Cayley graphs generated by small degree polynomials over finite fields
- Comparison of metric spectral gaps
- Length and Eigenvalue Equivalence
- Eigenvalues and diameter
- On some subgroups of the multiplicative group of finite rings
- What Do Networks and Elliptic Curves Have in Common?
- The cut metric, random graphs, and branching processes
- On Cayley sum graphs of non-abelian groups
- On the subgraphs of Cayley sum graphs
- On the eigenvalues of the graphs D(5,q)
- Asymptotic Absence of Poles of Ihara Zeta Function of Large Erdős–Rényi Random Graphs
- On the independence number of regular graphs of matrix rings
- On subgroup perfect codes in Cayley sum graphs
- A new sieve for distinct coordinate counting
- Towards a bilipschitz invariant theory
- Subgroup total perfect codes in Cayley sum graphs
- On Cayley sum signed graphs-I
- On Cayley sum signed graphs-II
- Metric uniformization and spectral bounds for graphs
- Curvature, diameter and signs of graphs
- Simple eigenvalues of cubic vertex-transitive graphs
This page was built for publication: Diameters and Eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3834081)
