Eigenvalues of the Laplacian of a graph∗
From MaRDI portal
Publication:3724375
DOI10.1080/03081088508817681zbMath0594.05046OpenAlexW2009233867MaRDI 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
Related Items
The clique number and the smallest \(Q\)-eigenvalue of graphs, The Laplacian and signless Laplacian spectrum of semi-Cayley graphs over abelian groups, The spectral characterization of wind-wheel graphs, On the multiplicity of Laplacian eigenvalues and Fiedler partitions, The Laplacian spread of unicyclic graphs, Extremal Halin graphs with respect to the signless Laplacian spectra, On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs, Edge perturbation on graphs with clusters: adjacency, Laplacian and signless Laplacian eigenvalues, Upper bounds on algebraic connectivity via convex optimization, Random talk: Random walk and synchronizability in a moving neighborhood network, Bicyclic graphs with maximum sum of the two largest Laplacian eigenvalues, A nontrivial upper bound on the largest Laplacian eigenvalue of weighted graphs, A new upper bound for eigenvalues of the Laplacian matrix of a graph, Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis, A note on Laplacian graph eigenvalues, On the Laplacian eigenvalues of a graph, Upper bounds on the (signless) Laplacian eigenvalues of graphs, On the distance Laplacian spectra of graphs, Laplacian spectrum characterization of extensions of vertices of wheel graphs and multi-fan graphs, An improved upper bound for Laplacian graph eigenvalues, On the Laplacian spectral radius of a tree., On the second largest Laplacian eigenvalues of graphs, The Laplacian spectral radii of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices, On the signless Laplacian index of cacti with a given number of pendant vertices, Some bounds on the largest eigenvalues of graphs, Extremal graphs with bounded vertex bipartiteness number, Proof of conjectures involving algebraic connectivity of graphs, 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., Bounds for the largest Laplacian eigenvalue of weighted graphs, On the bounds for the largest Laplacian eigenvalues of weighted graphs, On the distribution of Laplacian eigenvalues of a graph, New Nordhaus-Gaddum-type results for the Kirchhoff index, A sharp lower bound on the least signless Laplacian eigenvalue of a graph, On the signless Laplacian index of unicyclic graphs with fixed diameter, On the Laplacian spread of graphs, On ordering bicyclic graphs with respect to the Laplacian spectral radius, On graphs with at most three Laplacian eigenvalues greater than or equal to two., Some bounds for the Kirchhoff index of graphs, A decreasing sequence of upper bounds on the largest Laplacian eigenvalue of a graph., On the geometry and Laplacian of a graph, On the signless Laplacian spectra of \(k\)-trees, On the spectral radius of graphs, The Laplacian spectral radii of trees with degree sequences, Eigenvalue bounds for independent sets, The spectral radius of the reciprocal distance Laplacian matrix of a graph, The multi-fan graphs are determined by their Laplacian spectra, On the adjacency, Laplacian, and signless Laplacian spectrum of coalescence of complete graphs, Sharp upper and lower bounds for the Laplacian spectral radius and the spectral radius of graphs, Optimal topological design for distributed estimation over sensor networks, Laplacian spread of graphs: lower bounds and relations with invariant parameters, Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs, On limit points of Laplacian spectral radii of graphs, A domain monotonicity theorem for graphs and Hamiltonicity, On the number of Laplacian eigenvalues of trees smaller than two, On the Laplacian spectral radii of Halin graphs, Parallel alternating direction method of multipliers, The number of spanning trees in some classes of graphs, A survey of automated conjectures in spectral graph theory, A suboptimality approach to distributed \(\mathcal{H}_2\) control by dynamic output feedback, Kirchhoff index of composite graphs, On upper bounds for Laplacian graph eigenvalues, Bounds on the index of the signless Laplacian of a graph, Largest eigenvalue of a unicyclic mixed graphs, On the eigenvalue two and matching number of a tree, Asymptotic normality of Laplacian coefficients of graphs, On the spectra of nonsymmetric Laplacian matrices, Which wheel graphs are determined by their Laplacian spectra?, The Laplacian spectral radius of bicyclic graphs with a given girth, Some results on the bounds of signless Laplacian eigenvalues, Which digraphs with ring structure are essentially cyclic?, 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, On the Laplacian spectra of token graphs, A conjecture on the algebraic connectivity of connected graphs with fixed girth, Lower bounds on the (Laplacian) spectral radius of weighted graphs, Laplacian fractional revival on graphs, 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, When distributed formation control is feasible under hard constraints on energy and time?, Bounds for sums of eigenvalues and applications, Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs, An always nontrivial upper bound for Laplacian graph eigenvalues, Spectra of signed graphs, The signless Laplacian spectral radius of graphs with given number of pendant vertices, An improved upper bound for the Laplacian spectral radius of graphs, On the number of Laplacian eigenvalues of trees less than the average degree, Laplacian graph eigenvectors, 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, Laplacian matrices of graphs: A survey, A bound on the Laplacian spread which is tight for strongly regular graphs, A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph, On the sum of the two largest Laplacian eigenvalues of unicyclic graphs, Monster graphs are determined by their Laplacian spectra, Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems, Two-component feedback loops and deformed mechanics, Multi-agent systems for quadcopters, Initial state reconstruction on graphs, Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs, Eigen-stratified models, EVALUATION OF AUTOMATIC DOMAIN PARTITIONING ALGORITHMS FOR PARALLEL FINITE ELEMENT ANALYSIS, Unnamed Item, On Spectral Integral Variations of Graphs, On the Laplacian Eigenvalues of Signed Graphs, A note on the upper bounds for the Laplacian spectral radius of graphs, Tarantula graphs are determined by their Laplacian spectrum, Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs, Effective augmentation of networked systems and enhancing pinning controllability, Laplacian Spectra and Synchronization Processes on Complex Networks, Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size, Inertia indices and eigenvalue inequalities for Hermitian matrices, The Second Immanantal Polynomial and the Centroid of a Graph, Bounds for the largest and the smallest \(A_\alpha\) eigenvalues of a graph in terms of vertex degrees, An edge version of the matrix-tree theorem and the wiener index, Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star, A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph, On the full Brouwer's Laplacian spectrum conjecture, Classification of trees by Laplacian eigenvalue distribution and edge covering number, Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles, Proof of a conjecture on distribution of Laplacian eigenvalues and diameter, and beyond, Some new spectral bounds for graph irregularity, Constraint matrix factorization for space variant PSFs field restoration, Bounds on the parameters of non-\(L\)-borderenergetic graphs, Unnamed Item, The least eigenvalue of the signless Laplacian of the complements of trees, Bell Graphs are Determined by their Laplacian Spectra, A quasi-solution on a lattice graph for an initial state reconstruction, Decentralized personalized federated learning: lower bounds and optimal algorithm for all personalization modes, Extremal Graph Realizations and Graph Laplacian Eigenvalues, The most exigent eigenvalue: guaranteeing consensus under an unknown communication topology and time delays, 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, Can one hear the spanning trees of a quantum graph?, Unnamed Item, A note on the second largest eigenvalue of the laplacian matrix of a graph∗, On the ordering of the Kirchhoff indices of the complements of trees and unicyclic graphs, Unnamed Item, Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution, On the conjecture for certain Laplacian integral spectrum of graphs, Ordering trees by algebraic connectivity, A general system for heuristic minimization of convex functions over non-convex sets, The Laplacian permanental polynomial for trees, The p-spectral radius of the Laplacian matrix, Applications of rational difference equations to spectral graph theory, Laplacian spectral determination of path-friendship graphs, The ordering of trees and connected graphs by algebraic connectivity, A sharp upper bound for the number of spanning trees of a graph, Fault tolerant distributed portfolio optimization in smart grids, Ordering trees by their Laplacian spectral radii, On the sum of the two largest Laplacian eigenvalues of trees, de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph, Laplace spectra of orgraphs and their applications, Unnamed Item, Bounds for the Laplacian spectral radius of graphs, A minimax-condition for the characteristic center of a tree, Overcoming network resilience to synchronization through non-fast stochastic broadcasting, Comparison between Laplacian--energy--like invariant and Kirchhoff index, Unnamed Item, Upper bounds on the Laplacian spread of graphs, PageRank Beyond the Web, Dynamics of knowledge-intensive production: An agency-structure framework, An edge-grafting theorem on Laplacian spectra of graphs and its application, Partitioning a reaction–diffusion ecological network for dynamic stability, Fractional matching number and eigenvalues of a graph, Unnamed Item, Efficient rewirings for enhancing synchronizability of dynamical networks, The permanent of the Laplacian matrix of a bipartite graph, A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs, Open problem on \(\sigma\)-invariant, Bounds for the Laplacian spectral radius of graphs, The spectrum and eigenvectors of the Laplacian matrices of the Brualdi-Li tournament digraphs, Kernel Density Estimation on a Linear Network, The second least eigenvalue of the signless Laplacian of the complements of trees, NEW UPPER BOUND ON THE LARGEST LAPLACIAN EIGENVALUE OF GRAPHS, 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, On the α-spectral radius of graphs, Shifted simplicial complexes are Laplacian integral
Cites Work
