Nonderogatory unicyclic digraphs (Q925361)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nonderogatory unicyclic digraphs |
scientific article; zbMATH DE number 5282466
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonderogatory unicyclic digraphs |
scientific article; zbMATH DE number 5282466 |
Statements
Nonderogatory unicyclic digraphs (English)
0 references
3 June 2008
0 references
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.
0 references
digraph
0 references
nonderogatory
0 references
characteristic polynomial
0 references
minimal polynomial
0 references
0 references
0.85787416
0 references
0.8570863
0 references
0 references
