Eigenvalues of the Laplacian of a graph∗
From MaRDI portal
Publication:3724375
Recommendations
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3161527 (Why is no real title available?)
- scientific article; zbMATH DE number 3268838 (Why is no real title available?)
- On characterizing certain graphs with four eigenvalues by their spectra
- On hearing the shape of a drum
Cited in
(only showing first 100 items - show all)- Maximizing the Laplacian spectral radii of graphs with given diameter
- Some results on the Laplacian eigenvalues of unicyclic graphs
- The Laplacian spectral radius of tricyclic graphs with n vertices and k pendant vertices
- On graphs whose signless Laplacian index does not exceed 4.5
- The signless Laplacian spectral radius of graphs with given number of pendant vertices
- An improved upper bound for the Laplacian spectral radius of graphs
- A note on Laplacian graph eigenvalues
- On the Laplacian eigenvalues of a graph
- On the geometry and Laplacian of a graph
- A domain monotonicity theorem for graphs and Hamiltonicity
- Laplacian graph eigenvectors
- Laplacian matrices of graphs: A survey
- A new upper bound for eigenvalues of the Laplacian matrix of a graph
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- An improved upper bound for Laplacian graph eigenvalues
- On the Laplacian spectral radius of a tree.
- On the Laplacian spectral radius of a graph
- A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
- Two sharp upper bounds for the Laplacian eigenvalues.
- On graphs with at most three Laplacian eigenvalues greater than or equal to two.
- A decreasing sequence of upper bounds on the largest Laplacian eigenvalue of a graph.
- On the spectral radius of graphs
- Bounds for sums of eigenvalues and applications
- An always nontrivial upper bound for Laplacian graph eigenvalues
- A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
- On the multiplicity of Laplacian eigenvalues and Fiedler partitions
- A sharp lower bound on the least signless Laplacian eigenvalue of a graph
- Some bounds for the Kirchhoff index of graphs
- The spectral radius of the reciprocal distance Laplacian matrix of a graph
- Largest eigenvalue of a unicyclic mixed graphs
- On the spectra of nonsymmetric Laplacian matrices
- A new upper bound for the Laplacian spectral radius of graphs
- Characterization on graphs which achieve a Das' upper bound for Laplacian spectral radius
- Upper bound for the Laplacian graph eigenvalues
- Power-law partial correlation network models
- Sharp upper bounds for the Laplacian graph eigenvalues
- Bounding the largest eigenvalue of trees in terms of the largest vertex degree
- On graphs with small number of Laplacian eigenvalues greater than two
- Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis
- Minimum higher eigenvalues of Laplacians on graphs
- On the second largest Laplacian eigenvalues of graphs
- Proof of conjectures involving algebraic connectivity of graphs
- Bounds for the largest Laplacian eigenvalue of weighted graphs
- Parallel alternating direction method of multipliers
- Eigenvalues of the Laplacian on the Goldberg-Coxeter constructions for 3- and 4-valent graphs
- A suboptimality approach to distributed \(\mathcal{H}_2\) control by dynamic output feedback
- Asymptotic normality of Laplacian coefficients of graphs
- On sums of graph eigenvalues
- Some results on the bounds of signless Laplacian eigenvalues
- On the Laplacian spectra of token graphs
- Laplacian fractional revival on graphs
- When distributed formation control is feasible under hard constraints on energy and time?
- Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
- Spectra of signed graphs
- Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
- Multi-agent systems for quadcopters
- Eigen-stratified models
- Effective augmentation of networked systems and enhancing pinning controllability
- Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
- Bounds for the largest and the smallest \(A_\alpha\) eigenvalues of a graph in terms of vertex degrees
- Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star
- On the ordering of the Kirchhoff indices of the complements of trees and unicyclic graphs
- Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
- On the sum of the two largest Laplacian eigenvalues of trees
- Open problem on \(\sigma\)-invariant
- The spectrum and eigenvectors of the Laplacian matrices of the Brualdi-Li tournament digraphs
- Characterization of extremal graphs from Laplacian eigenvalues and the sum of powers of the Laplacian eigenvalues of graphs
- A graph interpretation of the least squares ranking method
- Eigenvalue conditions for induced subgraphs
- Partitions of networks that are robust to vertex permutation dynamics
- A new eigenvalue bound for independent sets
- Laplacian matrices and Alexandrov topologies of digraphs
- Two-component feedback loops and deformed mechanics
- Determinants of Laplacians on graphs
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
- Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs
- Some new spectral bounds for graph irregularity
- The least eigenvalue of the signless Laplacian of the complements of trees
- The Laplacian spread of quasi-tree graphs
- Bounds for the largest \(p\)-Laplacian eigenvalue for graphs
- On matrices associated to directed graphs and applications
- Spectra of combinatorial Laplace operators on simplicial complexes
- The ordering of trees and connected graphs by algebraic connectivity
- A sharp upper bound for the number of spanning trees of a graph
- Ordering trees by their Laplacian spectral radii
- Laplace spectra of orgraphs and their applications
- A bound on the Laplacian spread which is tight for strongly regular graphs
- A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs
- On the sum of the two largest Laplacian eigenvalues of unicyclic graphs
- A note on the upper bounds for the Laplacian spectral radius of graphs
- The clique number and the smallest \(Q\)-eigenvalue of graphs
- On the full Brouwer's Laplacian spectrum conjecture
- Can one hear the spanning trees of a quantum graph?
- A note on the second largest eigenvalue of the laplacian matrix of a graph∗
- Comparison between Laplacian-energy-like invariant and Kirchhoff index
- PageRank beyond the web
- Laplacian eigenvalues and multisections
- Laplacian spectra and synchronization processes on complex networks
- Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
- The Laplacian and signless Laplacian spectrum of semi-Cayley graphs over abelian groups
This page was built for publication: Eigenvalues of the Laplacian of a graph∗
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3724375)