Sharp upper bounds for the Laplacian graph eigenvalues
From MaRDI portal
(Redirected from Publication:1855381)
Recommendations
- A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
- A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
- Upper bounds for the largest eigenvalues of a bipartite graph
- A new upper bound for the Laplacian spectral radius of graphs
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
Cites work
Cited in
(42)- Upper bounds for the largest eigenvalues of a bipartite graph
- Network synchronizability analysis: a graph-theoretic approach
- Bounds for the Laplacian spectral radius of graphs
- scientific article; zbMATH DE number 5003617 (Why is no real title available?)
- Bounds on graph eigenvalues. I
- Minimizing the Laplacian eigenvalues for trees with given domination number
- The Laplacian spectral radius for unicyclic graphs with given independence number
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- On upper bounds for Laplacian graph eigenvalues
- Primal-dual method for optimization problems with changing constraints
- The minimum signless Laplacian spectral radius of graphs with given independence number
- The Laplacian spectral radius of bicyclic graphs with a given girth
- Which \(Q\)-cospectral graphs have same degree sequences
- Several sharp upper bounds for the largest Laplacian eigenvalue of a graph
- A relationship between bounds on the sum of squares of degrees of a graph
- An edge-grafting theorem on Laplacian spectra of graphs and its application
- The (signless) Laplacian spectral radii of \(c\)-cyclic graphs with \(n\) vertices, girth \(g\) and \(k\) pendant vertices
- The spectral characterization of wind-wheel graphs
- The most exigent eigenvalue: guaranteeing consensus under an unknown communication topology and time delays
- On the bounds for the largest Laplacian eigenvalues of weighted graphs
- The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
- Spectra of Laplacian matrices of semiregular bipartite graphs
- On the Laplacian integral tricyclic graphs
- Maximizing the sum of the squares of the degrees of a graph
- Network synchronizability analysis: the theory of subgraphs and complementary graphs
- Sharp upper bounds on the signless Laplacian spectral radius of strongly connected digraphs
- The signless Laplacian spread
- The Laplacian spectral radii of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
- A new upper bound for eigenvalues of the Laplacian matrix of a graph
- Some results on the Laplacian spectrum
- On the sharpness of spectral estimates for graph Laplacians
- Some graphs determined by their (signless) Laplacian spectra.
- scientific article; zbMATH DE number 6383827 (Why is no real title available?)
- Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection
- Ordering trees with n vertices and matching number q by their largest Laplacian eigenvalues
- A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
- Minimizing the Laplacian spectral radius of trees with given matching number
- A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
- Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs
- A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs
- The \(p\)-spectral radius of the Laplacian matrix
- On the Laplacian spectral radii of Halin graphs
This page was built for publication: Sharp upper bounds for the Laplacian graph eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1855381)
