Diameters and Eigenvalues
From MaRDI portal
Publication:3834081
DOI10.2307/1990973zbMath0678.05037MaRDI QIDQ3834081
Publication date: 1989
Full work available at URL: https://doi.org/10.2307/1990973
Related Items
Generators and irreducible polynomials over finite fields, Ramanujan graphs and Hecke operators, Quasi-Random Set Systems, On some subgroups of the multiplicative group of finite rings, The second eigenvalue of regular graphs of given girth, Lower bounds of the Laplacian spectrum of graphs based on diameter, Modified logarithmic Sobolev inequalities in discrete settings, Spectral partitioning works: planar graphs and finite element meshes, Factoring polynomials in finite fields: An application of Lang-Weil to a problem in graph theory, 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, 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, Dirichlet problem on locally finite graphs, On the spectra of hypertrees, Some results on diameters of 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, The Connectivity of addition Cayley graphs, An Estimate for Character Sums
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- On a class of degenerate extremal graph problems
- Sorting in \(c \log n\) parallel steps
- Expanding graphs contain all small trees
- Expanders obtained from affine transformations
- Ramanujan graphs
- Eigenvalues and expanders
- Theorems in the additive theory of numbers
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits
- Asymptotically optimal switching circuits
- Explicit constructions of linear-sized superconcentrators
- Intersection theorems with geometric consequences
- Equations over finite fields. An elementary approach
- Graph-theoretic properties in computational complexity
- Cycles of even length in graphs
- On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
- Explicit Concentrators from Generalized N-Gons
- Expanders and Diffusers
- Better expanders and superconcentrators
- Diameters of weighted double loop networks
- An Estimate for Character Sums
- Asymptotically tight bounds on time-space trade-offs in a pebble game
- Superconcentrators
- Correction to “Space Bounds for a Game on Graphs” by Wolfgang J. Paul, Robert Endre Tarjan and James R. Celoni
- On size Ramsey number of paths, trees, and circuits. I
- Minimal Regular Graphs of Girths Eight and Twelve
- On Minimal graphs of maximum even girth
- On Graphs that do not Contain a Thomsen Graph
