Nonderogatory directed webgraph (Q352540): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58988625, #quickstatements; #temporary_batch_1711234560214 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The characteristic polynomial of ladder digraph and an annihilating uniqueness theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3153561 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complete product of annihilatingly unique digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Nonderogatory unicyclic digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3570660 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3309525 / rank | |||
Normal rank | |||
Latest revision as of 14:16, 6 July 2024
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
