Gan, C. S. The complete product of annihilatingly unique digraphs. (English) Zbl 1076.05040 Int. J. Math. Math. Sci. 2005, No. 9, 1327-1331 (2005). 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. Cited in 2 Documents MSC: 05C20 Directed graphs (digraphs), tournaments 05C50 Graphs and linear algebra (matrices, eigenvalues, etc.) Keywords:adjacency matrix PDFBibTeX XMLCite \textit{C. S. Gan}, Int. J. Math. Math. Sci. 2005, No. 9, 1327--1331 (2005; Zbl 1076.05040) Full Text: DOI EuDML