Determinants of box products of paths

From MaRDI portal
Publication:418902

DOI10.1016/J.DISC.2012.01.038zbMATH Open1242.05168arXiv1110.3497OpenAlexW2064360228MaRDI QIDQ418902FDOQ418902


Authors: Daniel Pragel Edit this on Wikidata


Publication date: 30 May 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Suppose that G is the graph obtained by taking the box product of a path of length n and a path of length m. Let M be the adjacency matrix of G. If n=m, H.M. Rara showed in 1996 that det(M)=0. We extend this result to allow n and m to be any positive integers, and show that, if gcd(n+1,m+1)>1, then det(M)=0; otherwise, if gcd(n+1,m+1)=1, then det(M)=(-1)^(nm/2).


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




Recommendations




Cites Work


Cited In (7)





This page was built for publication: Determinants of box products of paths

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