Using digraphs to compute determinant, permanent, and Drazin inverse of circulant matrices with two parameters
From MaRDI portal
Publication:6589656
Cites work
- scientific article; zbMATH DE number 1601795 (Why is no real title available?)
- scientific article; zbMATH DE number 1185220 (Why is no real title available?)
- scientific article; zbMATH DE number 706263 (Why is no real title available?)
- A combinatorial approach to matrix theory and its applications
- Digraphs
- Drazin inverse of singular adjacency matrices of directed weighted cycles
- Further results on the perfect state transfer in integral circulant graphs
- Generalized Inverses of Linear Transformations
- Generalized inverses. Theory and applications.
- Graphs and matrices
- Integral circulant graphs
- Invertibility and explicit inverses of circulant-type matrices with \(k\)-Fibonacci and \(k\)-Lucas numbers
- Matrix calculus and Kronecker product. A practical approach to linear and multilinear algebra
- New results on the energy of integral circulant graphs
- On \(k\)-circulant matrices (with geometric sequence)
- On the clique number of integral circulant graphs
- On the determinants and inverses of circulant matrices with Fibonacci and Lucas numbers
- On the inverse of circulant matrix via generalized \(k\)-Horadam numbers
- On the kernel of integral circulant graphs
- The Rank of Circulant Matrices
- The inverse of circulant matrix
- The inverses of some circulant matrices
- Weighted Moore-Penrose, Drazin, and group inverses of the Kronecker product \(A \otimes B\), and some applications
Describes a project that uses
This page was built for publication: Using digraphs to compute determinant, permanent, and Drazin inverse of circulant matrices with two parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589656)