Recommendations
Cites work
- scientific article; zbMATH DE number 426360 (Why is no real title available?)
- scientific article; zbMATH DE number 4199650 (Why is no real title available?)
- scientific article; zbMATH DE number 4208110 (Why is no real title available?)
- scientific article; zbMATH DE number 5783701 (Why is no real title available?)
- scientific article; zbMATH DE number 3928113 (Why is no real title available?)
- scientific article; zbMATH DE number 4069889 (Why is no real title available?)
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 3722680 (Why is no real title available?)
- scientific article; zbMATH DE number 3733094 (Why is no real title available?)
- scientific article; zbMATH DE number 3745227 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3998694 (Why is no real title available?)
- scientific article; zbMATH DE number 3999929 (Why is no real title available?)
- scientific article; zbMATH DE number 863495 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 4193718 (Why is no real title available?)
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- scientific article; zbMATH DE number 3104192 (Why is no real title available?)
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- A domain monotonicity theorem for graphs and Hamiltonicity
- A minimax problem for graphs and its relation to generalized doubly stochastic matrices
- A new 5‐arc‐transitive cubic graph
- A projection technique for partitioning the nodes of a graph
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Absolute algebraic connectivity of trees
- An edge version of the matrix-tree theorem and the wiener index
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Bounds on expected hitting times for a random walk on a connected graph
- Bounds on the cover time
- Coalescence, majorization, edge valuations and the laplacian spectra of graphs
- Cohomological Aspects of Hypergraphs
- Counting colorful multi-dimensional trees
- Diameter, covering index, covering radius and eigenvalues
- Eigenvalues and expanders
- Eigenvalues, diameter, and mean distance in graphs
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Graph complexity and the laplacian matrix in blocked experiments
- Graph partitioning by eigenvectors
- Hitting times for random walks on vertex-transitive graphs
- Isoperimetric numbers of graphs
- Laplacian eigenvalues and the maximum cut problem
- Large eigenvalues of the laplacian
- Lower bounds for covering times for reversible Markov chains and random walks on graphs
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
- Maximum hitting time for random walks on graphs
- Node and edge relaxations of the max-cut problem
- On the Shannon capacity of a graph
- On the cover time of random walks on graphs
- On the optimality of block designs
- On the theoretical backgrounds of cluster analysis based on the eigenvalue problem of the association matrix
- On the time taken by random walks on finite groups to visit every state
- Optimal linear labelings and eigenvalues of graphs
- Ordering trees by algebraic connectivity
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Quasi-random graphs
- Quasi-random hypergraphs
- Quasi‐random classes of hypergraphs
- Ramanujan graphs
- Ramanujan graphs and Hecke operators
- Recent results in the theory of graph spectra
- Small eigenvalues of Riemann surfaces and graphs
- Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality
- The Laplacian Spectrum of a Graph
- The cover time of a regular expander is O(n log n)
- The distance spectrum of a tree
- The eigenvalues of random symmetric matrices
- The laplacian matrix of a graph: unimodular congruence
- The nonexistence of certain generalized polygons
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
- Theory of monomer-dimer systems
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(81)- Ordering trees by their Laplacian spectral radii
- Schrödinger operators on periodic discrete graphs
- Path Laplacian operators and superdiffusive processes on graphs. I: One-dimensional case
- Laplacian matrices of product graphs: applications in structural mechanics
- Old and new results on algebraic connectivity of graphs
- On a conjecture on a Laplacian matrix with distinct integral spectrum
- Spectra of graphs resulting from various graph operations and products: a survey
- A characterization of spectral integral variation in two places for Laplacian matrices
- Spectral band localization for Schrödinger operators on discrete periodic graphs
- Ordering trees by the Laplacian coefficients
- The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
- On the signless Laplacian spectral radius of irregular graphs
- Laplacian distribution and domination
- Domination number and Laplacian eigenvalue distribution
- On Hadamard diagonalizable graphs
- The property of maximal eigenvectors of trees
- Web document clustering using hyperlink structures
- Completion of Laplacian integral graphs via edge addition
- Multiplicity of integer roots of polynomials of graphs
- A survey of graph laplacians
- Lower bounds for the Laplacian spectral radius of graphs
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers
- Ordering trees with algebraic connectivity and diameter
- Computing the permanent of the Laplacian matrices of nonbipartite graphs
- Diffusion bank networks and capital flows
- Adjacency and Laplacian spectra of variants of neighborhood corona of graphs constrained by vertex subsets
- Laplacian spectral characterization of disjoint union of paths and cycles
- The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network
- Laplacian eigenvalues and partition problems in hypergraphs
- Partial characterization of graphs having a single large Laplacian eigenvalue
- On trees with exactly one characteristic element
- Critical point theory to isotropic discrete boundary value problems on weighted finite graphs
- On the adjoint of a matrix associated with trees
- Cut-off for large sums of graphs
- Laplacian integral graphs in \(S(a, b)\)
- Cut ratios and Laplacian eigenvalues
- Upper bound for the non-maximal eigenvalues of irreducible nonnegative matrices
- Sign-changing diagonal perturbations of Laplacian matrices of graphs
- Deconstructing the Gel'fand-Yaglom method and vacuum energy from a theory space
- Most Laplacian eigenvalues of a tree are small
- Graph-based point drift: graph centrality on the registration of point-sets
- On the spectra of nonsymmetric Laplacian matrices
- Bounds on graph eigenvalues. I
- scientific article; zbMATH DE number 2149406 (Why is no real title available?)
- On edge-rupture degree of graphs
- Graph characteristics from the heat kernel trace
- On minimum bisection and related partition problems in graphs with bounded tree width
- Scaling laws for diffusion on (trans)fractal scale-free networks
- Lexicographic polynomials of graphs and their spectra
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- On the Laplacian eigenvalues of a graph and Laplacian energy
- A probabilistic approach to case-based inference
- A divide-and-conquer bound for aggregate's quality and algebraic connectivity
- Laplace spectra of orgraphs and their applications
- Complex networks: structure and dynamics
- Spectral properties of unimodular lattice triangulations
- STUDY OF SOME GRAPHICAL PARAMETERS OF SOME GRAPH STRUCTURE
- Commute times for a directed graph using an asymmetric Laplacian
- On graphs with algebraic connectivity equal to minimum edge density
- Schur reduction of trees and extremal entries of the Fiedler vector
- On graphs with a single large Laplacian eigenvalue
- Eigenvalues of Cayley graphs
- Spectrum of super commuting graphs of some finite groups
- Laplacian matrices and Alexandrov topologies of digraphs
- On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
- Spectra of graph operations based on splitting graph
- scientific article; zbMATH DE number 719918 (Why is no real title available?)
- Spectrum of Graphs over Rings: A Survey
- Matryoshka and disjoint cluster synchronization of networks
- Proof of a conjecture on distribution of Laplacian eigenvalues and diameter, and beyond
- Laplacian eigenvalue distribution and diameter of graphs
- The algebraic connectivity of barbell graphs
- Discrete time heat kernel and UV modified propagators with dimensional deconstruction
- Structural vulnerability and robustness in complex networks: different approaches and relationships between them
- The Normalized Laplacian Spectrum of Folded Hypercube with Applications
- Laplacian spectra of cographs: a twin reduction perspective
- Extreme values of the Fiedler vector on trees
- Free energy on a cycle graph and trigonometric deformation of heat kernel traces on odd spheres
- Combinatorial Fiedler theory and graph partition
- Graph-theory induced gravity and strongly-degenerate fermions in a self-consistent Einstein universe
This page was built for publication: Laplace eigenvalues of graphs---a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686298)
