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).
Recommendations
Cites work
- scientific article; zbMATH DE number 3482387 (Why is no real title available?)
- On the location of the eigenvalues of Jacobi matrices
- Path polynomials of a circuit: a constructive approach
- Path polynomials of a graph
- Reduction procedures for calculating the determinant of the adjacency matrix of some graphs and the singularity of square planar grids
- Topics in graph theory. Graphs and their Cartesian product
Cited in
(7)- Determinants of grids, tori, cylinders and Möbius ladders
- Some determinants of path generating functions. II
- Domino tilings and determinants
- On characteristic and permanent polynomials of a matrix
- Retracts of box products with odd-angulated factors
- On the determinant of bipartite graphs
- Parameterized complexity of determinant and permanent
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)
