On the kernels of the incidence matrices of graphs
From MaRDI portal
Publication:1613538
DOI10.1016/S0012-365X(01)00370-3zbMath1001.05078OpenAlexW2002896906MaRDI QIDQ1613538
Publication date: 29 August 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00370-3
Related Items (6)
\(\{-1,0,1\}\)-basis for the null space of a forest ⋮ The kernels of the incidence matrices of graphs revisited ⋮ On the algorithmic complexity of zero-sum edge-coloring ⋮ Walking on vertices and edges by continuous-time quantum walk ⋮ On the eigenvalues of distance powers of circuits ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
This page was built for publication: On the kernels of the incidence matrices of graphs