Determinants in the Kronecker product of matrices: the incidence matrix of a complete graph

DOI10.1080/03081081003586852zbMATH Open1218.15003arXiv0811.1930OpenAlexW2158242114MaRDI QIDQ3006557FDOQ3006557

Authors: Christopher R. H. Hanusa, Thomas Zaslavsky 

Publication date: 20 June 2011

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

Abstract: We investigate the least common multiple of all subdeterminants, lcmd(A x B), of a Kronecker product of matrices, of which one is an integral matrix A with two columns and the other is the incidence matrix of a complete graph with n vertices. We prove that this quantity is the least common multiple of lcmd(A) to the power n-1 and certain binomial functions of the entries of A.

Full work available at URL: https://arxiv.org/abs/0811.1930

Recommendations

• Quasi Kronecker products and a determinant formula
• scientific article; zbMATH DE number 13121
• Resultants and trees
• Some vertex vulnerability parameters of Kronecker products of complete graphs
• scientific article; zbMATH DE number 599410

zbMATH Keywords

Kronecker productincidence matrixcomplete graphleast common multiplesubdeterminantsintegral matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Multilinear algebra, tensor calculus (15A69) Determinants, permanents, traces, other special matrix functions (15A15) Matrices of integers (15B36) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cited In (1)

• A \(q\)-queens problem. I: General theory

This page was built for publication: Determinants in the Kronecker product of matrices: the incidence matrix of a complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3006557)