The Laplacian Spectrum of a Graph II

DOI10.1137/S0895480191222653MaRDI QIDQ4296516zbMATH OpenFDO

Authors Russell Merris, Robert D. Grone

Publication date 11 September 1994

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480191222653

zbMATH Keywords

adjacency matrixdegree sequencediagonal matrixLaplacian integral graphsLaplacian matrixLaplacian spectrummajorization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• The Laplacian Spectrum of a Graph
• The Laplacian spectrum of a graph
• The Laplacian energy of some Laplacian integral graphs
• Laplacian integral graphs with a given degree sequence constraint
• Eigenvalues of the Laplacian of a graph^∗

Cited in

(only showing first 100 items - show all)

• The Laplacian spectral radius of a graph under perturbation
• Some results on the Laplacian eigenvalues of unicyclic graphs
• Laplacian spectrum of weakly quasi-threshold graphs
• The Laplacian spectral radius of some graphs
• The Laplacian spectral radius of tricyclic graphs with n vertices and k pendant vertices
• The minimum Laplacian spread of unicyclic graphs
• Laplacian graph eigenvectors
• Laplacian matrices of graphs: A survey
• Degree maximal graphs are Laplacian integral
• On spectral integral variations of mixed graphs
• A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
• Two sharp upper bounds for the Laplacian eigenvalues.
• Eigenvalues of a special kind of symmetric block circulant matrices
• Reconstruction of weighted graphs by their spectrum
• The critical group of a threshold graph
• On the multiplicity of Laplacian eigenvalues and Fiedler partitions
• Strong-coupling scales and the graph structure of multi-gravity theories
• On the von Neumann entropy of a graph
• On the second minimum algebraic connectivity of the graphs whose complements are trees
• On the dominating induced matching problem: spectral results and sharp bounds
• Note on an upper bound for sum of the Laplacian eigenvalues of a graph
• On a lower bound for the Laplacian eigenvalues of a graph
• Lower bounds for the Laplacian energy of bipartite graphs
• On the sum of k largest distance eigenvalues of graphs
• New bounds for the signless Laplacian spread
• Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs
• On line graphs with maximum energy
• Computing the Laplacian spectra of some graphs
• The Laplacian spectrum of a graph
• The number of spanning forests of a graph
• On the spectra of nonsymmetric Laplacian matrices
• Upper bound for the Laplacian graph eigenvalues
• Improved results on Brouwer's conjecture for sum of the Laplacian eigenvalues of a graph
• A note on Merris' conjectures
• Sharp lower bounds on the Laplacian eigenvalues of trees
• On the two conjectures of Graffiti
• Bounding the largest eigenvalue of trees in terms of the largest vertex degree
• The Laplacian eigenvalues of mixed graphs
• Multiplicity of integer roots of polynomials of graphs
• Bounds for the Kirchhoff index via majorization techniques
• On the second largest Laplacian eigenvalues of graphs
• Mysteries around the graph Laplacian eigenvalue 4
• Domination number and Laplacian eigenvalue of trees
• The adjacency and signless Laplacian spectra of cored hypergraphs and power hypergraphs
• Potential energy principles in networked systems and their connections to optimization problems on graphs
• Skewed converse and Laplacian spectral radius of weighted directed graphs
• On the Laplacian spectrum of k-uniform hypergraphs
• The Laplacian spread of line graphs
• On minimum algebraic connectivity of graphs whose complements are bicyclic
• Signless Laplacian spectral characterization of some disjoint union of graphs
• A novel measure of edge and vertex centrality for assessing robustness in complex networks
• Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
• Computing all Laplacian H-eigenvalues for a uniform loose path of length three
• Further developments on Brouwer's conjecture for the sum of Laplacian eigenvalues of graphs
• Most Laplacian eigenvalues of a tree are small
• On the sum of \(k\) largest Laplacian eigenvalues of a graph and clique number
• Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
• Laplacian eigenvalue distribution and graph parameters
• Hubs-biased resistance distances on graphs and networks
• `Hubs-repelling' Laplacian and related diffusion on graphs/networks
• The quasi-tree graph with maximum Laplacian spread
• On Brouwer's conjecture for the sum of \(k\) largest Laplacian eigenvalues of graphs
• Laplacian integrality in \(P_4\)-sparse and \(P_4\)-extendible graphs
• Spectra of graphs resulting from various graph operations and products: a survey
• Laplacian spectral characterization of some unicyclic graphs
• Characterization of extremal graphs from Laplacian eigenvalues and the sum of powers of the Laplacian eigenvalues of graphs
• Some relations between the eigenvalues of adjacency, Laplacian and signless Laplacian matrix of a graph
• Event based agreement protocols for multi-agent networks
• A class of posets with integral Laplacian spectrum
• Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs
• Applications of Estrada indices and energy to a family of compound graphs
• On the sum of the \(k\) largest eigenvalues of graphs and maximal energy of bipartite graphs
• Deleting vertices and interlacing Laplacian eigenvalues
• The Laplacian spread of quasi-tree graphs
• Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
• Edge-connectivity and (signless) Laplacian eigenvalue of graphs
• On Randić energy
• On matrices associated to directed graphs and applications
• Average consensus problems in networks of agents with delayed communications
• Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number
• On a conjecture for the signless Laplacian eigenvalues
• A decreasing sequence of upper bounds for the Laplacian energy of a tree
• An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs
• A majorization method for localizing graph topological indices
• The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs
• A sharp upper bound for the number of spanning trees of a graph
• Ordering trees by their Laplacian spectral radii
• Localized patterns in homogeneous networks of diffusively coupled reactors
• Laplace spectra of orgraphs and their applications
• Bounding the gap between extremal Laplacian eigenvalues of graphs
• 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
• Graphs with maximum Laplacian and signless Laplacian Estrada index
• Maximum Laplacian energy among threshold graphs
• The algebraic connectivity of graphs with given matching number
• Laplacian spectral bounds for clique and independence numbers of graphs
• On the full Brouwer's Laplacian spectrum conjecture
• On energy of line graphs
• A note on the second largest eigenvalue of the laplacian matrix of a graph^∗
• On the sum of the Laplacian eigenvalues of a graph and Brouwer's conjecture

This page was built for publication: The Laplacian Spectrum of a Graph II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4296516)