The complete product of annihilatingly unique digraphs (Q2575939)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2236247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complete product of annihilatingly unique digraphs |
scientific article; zbMATH DE number 2236247 |
Statements
The complete product of annihilatingly unique digraphs (English)
0 references
7 December 2005
0 references
Summary: Let \(G\) be a digraph with \(n\) vertices and let \(A(G)\) be its adjacency matrix. A monic polynomial \(f(x)\) of degree at most \(n\) is called an annihilating polynomial of \(G\) if \(f(A(G)) = 0\). \(G\) is said to be annihilatingly unique if it possesses a unique annihilating polynomial. Difans and diwheels are two classes of annihilatingly unique digraphs. In this paper, it is shown that the complete product of difan and diwheel is annihilatingly unique.
0 references
adjacency matrix
0 references
0.8488396406173706
0 references
0.7458522319793701
0 references