Nonderogatory directed webgraph (Q352540): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C76 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C50 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C78 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6184382 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
vertex labeled digraph | |||
| Property / zbMATH Keywords: vertex labeled digraph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
adjacency matrix | |||
| Property / zbMATH Keywords: adjacency matrix / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
nonderogatory digraph | |||
| Property / zbMATH Keywords: nonderogatory digraph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
characterictic polynomial | |||
| Property / zbMATH Keywords: characterictic polynomial / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
minimal polynomial | |||
| Property / zbMATH Keywords: minimal polynomial / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
ladder graphs | |||
| Property / zbMATH Keywords: ladder graphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
difans | |||
| Property / zbMATH Keywords: difans / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
diwheels | |||
| Property / zbMATH Keywords: diwheels / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
dipath | |||
| Property / zbMATH Keywords: dipath / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
dicycle | |||
| Property / zbMATH Keywords: dicycle / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Cartesian product | |||
| Property / zbMATH Keywords: Cartesian product / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
diwebgraph | |||
| Property / zbMATH Keywords: diwebgraph / rank | |||
Normal rank | |||
Revision as of 08:43, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nonderogatory directed webgraph |
scientific article |
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
