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