Spectra of products of digraphs

Main Article Content

Minerva Catral
Lorenzo Ciardo
https://orcid.org/0000-0001-9491-2016
Leslie Hogben
https://orcid.org/0000-0003-1673-3789
Carolyn Reinhart

Abstract

A unified approach to the determination of eigenvalues and eigenvectors of specific matrices associated with directed graphs is presented. Matrices studied include the new distance matrix, with natural extensions to the distance Laplacian and distance signless Laplacian, in addition to the new adjacency matrix, with natural extensions to the Laplacian and signless Laplacian. Various sums of Kronecker products of nonnegative matrices are introduced to model the Cartesian and lexicographic products of digraphs. The Jordan canonical form is applied extensively to the analysis of spectra and eigenvectors. The analysis shows that Cartesian products provide a method for building infinite families of transmission regular digraphs with few distinct distance eigenvalues.

Article Details

Section
Article