\-1,0,1\-basis for the null space of a forest
From MaRDI portal
Publication:2369049
Recommendations
- A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time
- On the null space structure associated with trees and cycles
- Null space structure of tree-patterned matrices
- Properties of a representation of a basis for the null space
- Nowhere-zero bases for the nullspace of the incidence matrices of graphs
- Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices
- On the topology of rooted forests in higher dimensions
- On some forests determined by their Laplacian or signless Laplacian spectrum
- scientific article; zbMATH DE number 1257257
- On the rooted forests in triangulated closed manifolds
Cites work
- A note on labelings of graphs
- scientific article; zbMATH DE number 1250661 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- On the bases of trades
- On the kernels of the incidence matrices of graphs
- The kernels of the incidence matrices of graphs revisited
Cited in
(10)- A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time
- Weakly Hadamard diagonalizable graphs
- The kernels of the incidence matrices of graphs revisited
- On Hadamard diagonalizable graphs
- Moore-Penrose inverse of the signless Laplacians of bipartite graphs
- Laplacian \(\{-1,0,1\}\)- and \(\{-1,1\}\)-diagonalizable graphs
- Null decomposition and a combinatorial-block generalized inversion of trees
- On unimodular graphs
- Tree decomposition by eigenvectors
- On the eigenvalues of distance powers of circuits
This page was built for publication: \(\{-1,0,1\}\)-basis for the null space of a forest
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369049)
