\(\{-1,0,1\}\)-basis for the null space of a forest

DOI10.1016/j.laa.2005.10.028zbMath1086.05047OpenAlexW2121376290MaRDI QIDQ2369049

Alireza Alipour, Ebrahim Ghorbani, Gholamreza Khosrovshahi, Saieed Akbari

Publication date: 28 April 2006

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

Full work available at URL: https://doi.org/10.1016/j.laa.2005.10.028

zbMATH Keywords

Unicyclic graphBasisForestNull space

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (max. 100)

The kernels of the incidence matrices of graphs revisited ⋮ On unimodular graphs ⋮ Moore-Penrose inverse of the signless Laplacians of bipartite graphs ⋮ Weakly Hadamard diagonalizable graphs ⋮ A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time ⋮ Tree decomposition by eigenvectors ⋮ On the eigenvalues of distance powers of circuits ⋮ On Hadamard diagonalizable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the kernels of the incidence matrices of graphs
• On the bases of trades
• The kernels of the incidence matrices of graphs revisited
• A note on labelings of graphs

This page was built for publication: \(\{-1,0,1\}\)-basis for the null space of a forest