Eigenvectors of acyclic matrices
From MaRDI portal
Publication:4088941
DOI10.21136/cmj.1975.101356zbMath0325.15014OpenAlexW1528970839MaRDI QIDQ4088941
Publication date: 1975
Full work available at URL: https://eudml.org/doc/12899
Inequalities involving eigenvalues and eigenvectors (15A42) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)
Related Items (62)
Spectral shift via ``lateral perturbation ⋮ Graph Laplacians, nodal domains, and hyperplane arrangements ⋮ An estimate for the nonstochastic eigenvalues of doubly stochastic matrices ⋮ Extremal Halin graphs with respect to the signless Laplacian spectra ⋮ Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs ⋮ An efficient communications strategy for finite element methods on the Connection Machine CM-5 system ⋮ Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis ⋮ On trees with exactly one characteristic element ⋮ Spectral partitioning works: planar graphs and finite element meshes ⋮ On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph ⋮ Old and new results on algebraic connectivity of graphs ⋮ Unnamed Item ⋮ The nodal count {0,1,2,3,…} implies the graph is a tree ⋮ Acyclic matrices with a small number of distinct eigenvalues ⋮ Symmetric matrices, signed graphs, and nodal domain theorems ⋮ Multiplicity of the second‐largest eigenvalue of a planar graph ⋮ On the distance Laplacian spectra of graphs ⋮ Null decomposition of trees ⋮ Unnamed Item ⋮ On the signless Laplacian index of cacti with a given number of pendant vertices ⋮ Nodal domain theorems for \(p\)-Laplacians on signed graphs ⋮ The least eigenvalue of the signless Laplacian of the complements of trees ⋮ Nodal domain count for the generalized graph \(p\)-Laplacian ⋮ Sparks of symmetric matrices and their graphs ⋮ Some bounds on the largest eigenvalues of graphs ⋮ Null vectors, Schur complements, and Parter vertices ⋮ On graphs with algebraic connectivity equal to minimum edge density ⋮ On spectral integral variations of mixed graphs ⋮ Permanental polynomials of graphs ⋮ On the signless Laplacian index of unicyclic graphs with fixed diameter ⋮ The effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edges ⋮ The second largest eigenvalue of a tree ⋮ On Fiedler- and Parter-vertices of acyclic matrices ⋮ Spectral bisection of graphs and connectedness ⋮ Ordering trees with nearly perfect matchings by algebraic connectivity ⋮ Characterizing graphs with maximal Laplacian Estrada index ⋮ On the geometry and Laplacian of a graph ⋮ Metric uniformization and spectral bounds for graphs ⋮ On the signless Laplacian spectra of \(k\)-trees ⋮ Modeling of industrial problems on high-performance polyprocessor computing systems ⋮ Ordering trees with algebraic connectivity and diameter ⋮ Some inverse problems for acyclic matrices ⋮ The effect on the algebraic connectivity of a tree by grafting or collapsing of edges ⋮ A lower bound for nodal count on discrete and metric graphs ⋮ Tree decomposition by eigenvectors ⋮ The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices ⋮ A survey of automated conjectures in spectral graph theory ⋮ Factoring matrices with a tree-structured sparsity pattern ⋮ Some results on the bounds of signless Laplacian eigenvalues ⋮ Discrete nodal domain theorems ⋮ Maximal P-sets of matrices whose graph is a tree ⋮ Smith normal form and acyclic matrices ⋮ The signless Laplacian spectral radius of graphs with given number of pendant vertices ⋮ Minimum-rank matrices with prescribed graph ⋮ The spectral radius of submatrices of Laplacian matrices for trees and its comparison to the Fiedler vector ⋮ The second least eigenvalue of the signless Laplacian of the complements of trees ⋮ NEW UPPER BOUND ON THE LARGEST LAPLACIAN EIGENVALUE OF GRAPHS ⋮ Estimating modes of a complex dynamical network from impulse response data: Structural and graph‐theoretic characterizations ⋮ Null space structure of tree-patterned matrices ⋮ Fiedler vector analysis for particular cases of connected graphs ⋮ A discrete nodal domain theorem for trees ⋮ Laplacian matrices of graphs: A survey
Cites Work
This page was built for publication: Eigenvectors of acyclic matrices