Laplace eigenvalues of graphs---a survey (Q686298): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the time taken by random walks on finite groups to visit every state / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting times for random walks on vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for covering times for reversible Markov chains and random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and expanders / 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: Q4871774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3588187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new 5‐arc‐transitive cubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the cover time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4725290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small eigenvalues of Riemann surfaces and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5614192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi‐random classes of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimality of block designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4726256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph complexity and the laplacian matrix in blocked experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results in the theory of graph spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian eigenvalues and the maximum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonexistence of certain generalized polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3877805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3356330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute algebraic connectivity of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimax problem for graphs and its relation to generalized doubly stochastic matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5842949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The eigenvalues of random symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering trees by algebraic connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalescence, majorization, edge valuations and the laplacian spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Laplacian Spectrum of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large eigenvalues of the laplacian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of monomer-dimer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theoretical backgrounds of cluster analysis based on the eigenvalue problem of the association matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3920472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal linear labelings and eigenvalues of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cover time of random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: An edge version of the matrix-tree theorem and the wiener index / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distance spectrum of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isoperimetric numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A domain monotonicity theorem for graphs and Hamiltonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues, diameter, and mean distance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on expected hitting times for a random walk on a connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs and Hecke operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Sparse Matrices with Eigenvectors of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning by eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cover time of a regular expander is O(n log n) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The laplacian matrix of a graph: unimodular congruence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting colorful multi-dimensional trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum hitting time for random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cohomological Aspects of Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The performance of an eigenvalue bound on the max-cut problem in some classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter, covering index, covering radius and eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random polynomial-time algorithm for approximating the volume of convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Lower Bound Via Projection for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node and edge relaxations of the max-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection technique for partitioning the nodes of a graph / rank
 
Normal rank

Latest revision as of 10:07, 22 May 2024

scientific article
Language Label Description Also known as
English
Laplace eigenvalues of graphs---a survey
scientific article

    Statements

    Laplace eigenvalues of graphs---a survey (English)
    0 references
    0 references
    14 October 1993
    0 references
    In this reporting paper, several applications of Laplace eigenvalues of graphs in graph theory and combinatorial optimization are outlined. They include the edge density in cuts, partitioning with eigenvectors, Laplacian on hypergraphs, Hamiltonicity and \(\zeta\)-functions on graphs. The bibliography contains 93 papers and books related to these items.
    0 references
    Laplace eigenvalues
    0 references
    eigenvectors
    0 references
    Laplacian
    0 references
    hypergraphs
    0 references
    Hamiltonicity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references