The complete product of annihilatingly unique digraphs (Q2575939): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1040094
Import240304020342 (talk | contribs)
Set profile property.
 
(One intermediate revision by one other user not shown)
Property / author
 
Property / author: Che Sheng Gan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 07:37, 5 March 2024

scientific article
Language Label Description Also known as
English
The complete product of annihilatingly unique digraphs
scientific article

    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 references

    Identifiers