On very sparse circulant \((0,1)\) matrices

DOI10.1016/J.LAA.2006.02.029zbMath1110.15014OpenAlexW1965202611MaRDI QIDQ855544

Norma Zagaglia Salvi, R. Salvi

Publication date: 7 December 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.2006.02.029

zbMATH Keywords

bipartite graphcirculant matrixgenuspermanent\((0,1)\)-matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrices of integers (15B36)

Related Items (2)

Highly symmetric generalized circulant permutation matrices ⋮ Some results on certain generalized circulant matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recurrence formulas for permanents of (0,1)-circulants
• On the permanent of certain \((0,1)\) Toeplitz matrices
• On the number of different permanents of some sparse (0,1)-circulant matrices.
• Matchings in graphs on non-orientable surfaces
• Computation of sparse circulant permanents via determinants
• An update on Minc's survey of open problems involving permanents
• Permanents
• Permanents of (0, 1)-Circulants

This page was built for publication: On very sparse circulant \((0,1)\) matrices