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.
A. Mowshowitz, “Graphs, groups and matrices,” in Proceedings of the 25th Summer Meeting of the Canadian Mathematical Congress, pp. 509–522, Lakehead University, Thunder Bay, Ont, Canada, 1971.
View at: Google Scholar | Zentralblatt MATH | MathSciNetD. M. Cvetković, M. Doob, and H. Sachs, Spectra of Graphs, vol. 87 of Pure and Applied Mathematics, Academic Press, New York, NY, USA, 1980.
View at: Zentralblatt MATH | MathSciNetC. S. Gan and V. C. Koo, “On annihilating uniqueness of directed windmills,” in Proceedings of the 7th Asian Technology Conference in Mathematics (ATCM '02), Melaka, Malaysia, December 2002.
View at: Google ScholarC. S. Gan, “The complete product of annihilatingly unique digraphs,” International Journal of Mathematics and Mathematical Sciences, vol. 2005, no. 9, pp. 1327–1331, 2005.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetK. S. Lam, On digraphs with unique annihilating polynomial, Ph.D. thesis, University of Malaya, Kuala Lumpur, Malaysia, 1990.
C.-K. Lim and K. S. Lam, “The characteristic polynomial of ladder digraph and an annihilating uniqueness theorem,” Discrete Mathematics, vol. 151, no. 1–3, pp. 161–167, 1996.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetJ. Rada, “Non-derogatory directed windmills,” in preparation.
View at: Google ScholarD. Bravo and J. Rada, “Coalescence of difans and diwheels,” to appear in Bulletin of the Malaysian Mathematical Sciences Society.
View at: Google Scholar