Diameters and Eigenvalues
From MaRDI portal
Publication:3834081
DOI10.2307/1990973zbMath0678.05037OpenAlexW4212904170MaRDI QIDQ3834081
Publication date: 1989
Full work available at URL: https://doi.org/10.2307/1990973
Related Items
Character sums, primitive elements, and powers in finite fields, Markov chains on finite fields with deterministic jumps, On integral Cayley sum graphs, Hash functions and Cayley graphs, Quasi-Random Set Systems, Eigenvalues of Cayley graphs, Evolutionary escape on complex genotype-phenotype networks, Graph spectra for finite upper half planes over rings, The alternating polynomials and their relation with the spectra and conditional diameters of graphs, Eigenvalues, eigenspaces and distances to subsets, Laplacian spectral bounds for clique and independence numbers of graphs, Nonabelian sets with distinct \(k\)-sums, UNIT AND UNITARY CAYLEY GRAPHS FOR THE RING OF EISENSTEIN INTEGERS MODULO \(n\), Finite fields and Ramanujan graphs, Unitary Addition Cayley Ring Signed Graphs *, Integral Cayley sum graphs and groups, Factor base discrete logarithms in Kummer extensions, Cutoff on all Ramanujan graphs, Lower bounds of the Laplacian spectrum of graphs based on diameter, From local adjacency polynomials to locally pseudo-distance-regular graphs, Modified logarithmic Sobolev inequalities in discrete settings, Spectral partitioning works: planar graphs and finite element meshes, Some things we've learned (about Markov chain Monte Carlo), Algebraic Cayley graphs over finite local rings, Boundary graphs. II: The limit case of a spectral property, Generating sets for the multiplicative groups of algebras over finite fields and expander graphs, Direct scaling analysis of localization in single-particle quantum systems on graphs with diagonal disorder, Energy bounds, bilinear forms and their applications in function fields, On the subgraphs of Cayley sum graphs, Algebraic Cayley graphs over finite fields, The Connectivity of addition Cayley graphs, A new sieve for distinct coordinate counting, 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, Unnamed Item, Ultrametric subsets with large Hausdorff dimension, Cayley sum graphs and their applications to codebooks, Diameters, distortion, and eigenvalues, Generators and irreducible polynomials over finite fields, Expander graphs and gaps between primes, Factoring polynomials in finite fields: An application of Lang-Weil to a problem in graph theory, Bound on the diameter of metacyclic groups, Cayley sum color and anti-circulant graphs, Diameter, covering index, covering radius and eigenvalues, Eigenvalues, diameter, and mean distance in graphs, Metric uniformization and spectral bounds for graphs, On the spectrum of hypergraphs, The symbiotic relationship of combinatorics and matrix theory, Dirichlet problem on locally finite graphs, Comparison of Metric Spectral Gaps, The spectra of Manhattan street networks, Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs, A natural graph of finite fields distinguishing between models, From fixed-energy localization analysis to dynamical localization: an elementary path, On the spectra of hypertrees, Eigenvalues and diameter, On some subgroups of the multiplicative group of finite rings, Some results on diameters of Cayley graphs, A spectral version of the Moore problem for bipartite regular graphs, The cut metric, random graphs, and branching processes, On Cayley sum graphs of non-abelian groups, A Cheeger type inequality in finite Cayley sum graphs, Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes, Regular Turán numbers of complete bipartite graphs, Connectivity of addition Cayley graphs, Eigenvalue Ratios of Non-Negatively Curved Graphs, The spectra of multiplicative attribute graphs, Orthogonal Polarity Graphs and Sidon Sets, Some geometric aspects of graphs and their eigenfunctions, Ramanujan graphs and Hecke operators, The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs, Multidiameters and multiplicities, The second eigenvalue of regular graphs of given girth, Polynomial factorisation and an application to regular directed graphs, On the spectra of certain graphs arising from finite fields, Unnamed Item, On the Expansion of Group-Based Lifts, Perfect codes in Cayley sum graphs, Subgroup perfect codes in Cayley sum graphs, On random random walks, On the Laplacian spectrum of \(k\)-uniform hypergraphs, Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods, Some graphs with small second eigenvalue, On the second eigenvalue of hypergraphs, An eigenvalue bound for the Laplacian of a graph, Cayley Graphs Generated by Small Degree Polynomials over Finite Fields, On Middle Cube Graphs, The maximum spectral radius of non-bipartite graphs forbidding short odd cycles, On the Expansion of Group-Based Lifts, On the spectrum, the growth, and the diameter of a graph, An Estimate for Character Sums, What Do Networks and Elliptic Curves Have in Common?, Laplacian matrices of graphs: A survey, Loose laplacian spectra of random hypergraphs
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
