Eigenvalues of the Laplacian of a graph∗
From MaRDI portal
Publication:3724375
DOI10.1080/03081088508817681zbMath0594.05046MaRDI QIDQ3724375
T. D. Morley, William N. jun. Anderson
Publication date: 1985
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2060/19720008812
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph, On Spectral Integral Variations of Graphs, Unnamed Item, Unnamed Item, On the Laplacian Eigenvalues of Signed Graphs, A minimax-condition for the characteristic center of a tree, Unnamed Item, Bounds for the Laplacian spectral radius of graphs, Ordering trees by algebraic connectivity, de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph, Laplacian spectrum characterization of extensions of vertices of wheel graphs and multi-fan graphs, The Laplacian spectral radii of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices, On the eigenvalue two and matching number of a tree, The Laplacian spread of unicyclic graphs, Upper bounds on algebraic connectivity via convex optimization, Random talk: Random walk and synchronizability in a moving neighborhood network, A nontrivial upper bound on the largest Laplacian eigenvalue of weighted graphs, The Laplacian spectral radii of trees with degree sequences, Eigenvalue bounds for independent sets, The multi-fan graphs are determined by their Laplacian spectra, Sharp upper and lower bounds for the Laplacian spectral radius and the spectral radius of graphs, On limit points of Laplacian spectral radii of graphs, A survey of automated conjectures in spectral graph theory, Kirchhoff index of composite graphs, On upper bounds for Laplacian graph eigenvalues, Bounds on the index of the signless Laplacian of a graph, Which wheel graphs are determined by their Laplacian spectra?, The Laplacian spectral radius of bicyclic graphs with a given girth, Which digraphs with ring structure are essentially cyclic?, A conjecture on the algebraic connectivity of connected graphs with fixed girth, 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, 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, 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, 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, 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, The Laplacian spread of quasi-tree graphs, Bounds for the largest \(p\)-Laplacian eigenvalue for graphs, 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 sharp upper bound on the largest Laplacian eigenvalue of weighted graphs, A note on the second largest eigenvalue of the laplacian matrix of a graph∗, An edge-grafting theorem on Laplacian spectra of graphs and its application, Shifted simplicial complexes are Laplacian integral, An edge version of the matrix-tree theorem and the wiener index, On the conjecture for certain Laplacian integral spectrum of graphs, Unnamed Item, The Second Immanantal Polynomial and the Centroid of a Graph, Unnamed Item
Cites Work
