Nonderogatory Directed Webgraph

By assigning a certain direction to the webgraphs, which are defined as the Cartesian product of cycles and paths, we prove that they are nonderogatory

Nonderogatory Unicyclic Digraphs

A digraph is nonderogatory if its characteristic polynomial and minimal polynomial are equal. We find a characterization of nonderogatory unicyclic digraphs in terms of Hamiltonicity conditions. An immediate consequence of this characterization ia that the complete product of difans and diwheels is nonderogatory