Cites work
Cited in
(68)- Smith normal form and acyclic matrices
- The signless Laplacian spectral radius of graphs with given number of pendant vertices
- On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph
- Permanental polynomials of graphs
- The second largest eigenvalue of a tree
- On the geometry and Laplacian of a graph
- Null space structure of tree-patterned matrices
- Laplacian matrices of graphs: A survey
- An estimate for the nonstochastic eigenvalues of doubly stochastic matrices
- On graphs with algebraic connectivity equal to minimum edge density
- On spectral integral variations of mixed graphs
- Null decomposition of trees
- A discrete nodal domain theorem for trees
- Graph Laplacians, nodal domains, and hyperplane arrangements
- 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
- Some results on the bounds of signless Laplacian eigenvalues
- Spectral shift via ``lateral perturbation
- The least eigenvalue of the signless Laplacian of the complements of trees
- Spectral bisection of graphs and connectedness
- Modeling of industrial problems on high-performance polyprocessor computing systems
- Ordering trees with algebraic connectivity and diameter
- The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
- The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices
- Minimum-rank matrices with prescribed graph
- The spectral radius of submatrices of Laplacian matrices for trees and its comparison to the Fiedler vector
- Nodal domain count for the generalized graph \(p\)-Laplacian
- Null vectors, Schur complements, and Parter vertices
- The nodal count \(\{0,1,2,3,\ldots\}\) implies the graph is a tree
- Extremal Halin graphs with respect to the signless Laplacian spectra
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
- The effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edges
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- Acyclic matrices with a small number of distinct eigenvalues
- On the distance Laplacian spectra of graphs
- On the signless Laplacian index of cacti with a given number of pendant vertices
- Some bounds on the largest eigenvalues of graphs
- Characterizing graphs with maximal Laplacian Estrada index
- scientific article; zbMATH DE number 4114654 (Why is no real title available?)
- On the signless Laplacian spectra of \(k\)-trees
- 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
- Factoring matrices with a tree-structured sparsity pattern
- Fiedler vector analysis for particular cases of connected graphs
- Discrete nodal domain theorems
- Symmetric matrices, signed graphs, and nodal domain theorems
- Multiplicity of the second‐largest eigenvalue of a planar graph
- Nodal domain theorems for p-Laplacians on signed graphs
- Sparks of symmetric matrices and their graphs
- On the signless Laplacian index of unicyclic graphs with fixed diameter
- Metric uniformization and spectral bounds for graphs
- Distance Laplacian spectra of graphs: a survey
- Some inverse problems for acyclic matrices
- Distance signless Laplacian spectra of graphs: a survey
- The Laplacian and distance matrix of a signed tree
- Nodal domain theorems of signed hypergraphs
- Nodal count for a random signing of a graph with disjoint cycles
- Inverse Fiedler vector problem of a graph
- Maximal P-sets of matrices whose graph is a tree
- On trees with exactly one characteristic element
- Spectral partitioning works: planar graphs and finite element meshes
- Old and new results on algebraic connectivity of graphs
- On Fiedler- and Parter-vertices of acyclic matrices
- Ordering trees with nearly perfect matchings by algebraic connectivity
- A lower bound for nodal count on discrete and metric graphs
- Tree decomposition by eigenvectors
- A survey of automated conjectures in spectral graph theory
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)
