Tree decomposition by eigenvectors

DOI10.1016/j.laa.2008.07.015zbMath1161.05310arXiv1112.3193OpenAlexW2099853189MaRDI QIDQ958004

Torsten Sander, Jürgen Sander

Publication date: 2 December 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.3193

zbMATH Keywords

basisnull spacecomposition-decomposition techniqueeigenspace basematching propertiesskeleton foresttree eigenvectors

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (4)

The non-negative spectrum of a digraph ⋮ Null decomposition of trees ⋮ Nullspace vertex partition in graphs ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications

Cites Work

• Graph partitioning by eigenvectors
• Null space structure of tree-patterned matrices
• On the construction of graphs of nullity one
• Trees with maximum nullity
• \(\{-1,0,1\}\)-basis for the null space of a forest
• On simply structured bases of tree kernels
• Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
• Partly zero eigenvectors and matrices that satisfyAu=b
• Eigenvectors of acyclic matrices
• Reducing the adjacency matrix of a tree
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tree decomposition by eigenvectors