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...
Main Authors: | Diego Bravo, Juan Rada |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2007-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Online Access: | http://dx.doi.org/10.1155/2007/46851 |
Similar Items
-
Nonderogatory Directed Webgraph
by: Ilhan Hacioglu, et al.
Published: (2013-01-01) -
On chordal digraphs and semi-strict chordal digraphs
by: Ye, Ying Ying
Published: (2019) -
Unicycling Ruts—The Self-narrative of a Primary School Teacher and Unicycle Coach.
by: Lin, Tai-Chen, et al.
Published: (2016) -
-panchromatic digraphs
by: Hortensia Galeana-Sánchez, et al.
Published: (2020-01-01) -
Power on Digraphs
by: Hans Peters, et al.
Published: (2016-01-01)