Diameters and Eigenvalues (Q3834081): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Diameters and Eigenvalues
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/1990973 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4212904170 / rank
 
Normal rank
Property / title
 
Diameters and Eigenvalues (English)
Property / title: Diameters and Eigenvalues (English) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better expanders and superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically optimal switching circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On size Ramsey number of paths, trees, and circuits. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Regular Graphs of Girths Eight and Twelve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of even length in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorems in the additive theory of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphs that do not Contain a Thomsen Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanders and Diffusers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters of weighted double loop networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of degenerate extremal graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanding graphs contain all small trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit constructions of linear-sized superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanders obtained from affine transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Estimate for Character Sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically tight bounds on time-space trade-offs in a pebble game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correction to “Space Bounds for a Game on Graphs” by Wolfgang J. Paul, Robert Endre Tarjan and James R. Celoni / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equations over finite fields. An elementary approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimal graphs of maximum even girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Concentrators from Generalized <i>N</i>-Gons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs for computing functions, using connectivity properties of their circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic properties in computational complexity / rank
 
Normal rank

Latest revision as of 10:14, 20 June 2024

scientific article
Language Label Description Also known as
English
Diameters and Eigenvalues
scientific article

    Statements

    0 references
    1989
    0 references
    0 references
    regular graph
    0 references
    degree
    0 references
    diameter
    0 references
    eigenvalues
    0 references
    expanders
    0 references
    0 references
    0 references
    Diameters and Eigenvalues (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references