Nonderogatory directed webgraph (Q352540)
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 directed webgraph |
scientific article; zbMATH DE number 6184382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonderogatory directed webgraph |
scientific article; zbMATH DE number 6184382 |
Statements
Nonderogatory directed webgraph (English)
0 references
5 July 2013
0 references
Summary: 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.
0 references
vertex labeled digraph
0 references
adjacency matrix
0 references
nonderogatory digraph
0 references
characterictic polynomial
0 references
minimal polynomial
0 references
ladder graphs
0 references
difans
0 references
diwheels
0 references
dipath
0 references
dicycle
0 references
Cartesian product
0 references
diwebgraph
0 references
0 references
0 references
0 references
0 references
0.8308413
0 references
0 references
0 references
