05282466

j

05282466 Bravo, Diego Rada, Juan Nonderogatory unicyclic digraphs. Int. J. Math. Math. Sci. 2007, Article ID 46851, 8 p. (2007). 2007 Hindawi Publishing Corporation, New York, NY EN digraph nonderogatory characteristic polynomial minimal polynomial

doi:10.1155/2007/46851

Summary: 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.