The complete product of annihilatingly unique digraphs

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...

Full description

Saved in:
Bibliographic Details
Main Author: C. S. GAN
Format: Article
Language:English
Published: Wiley 2005-01-01
Series:International Journal of Mathematics and Mathematical Sciences
Online Access:http://dx.doi.org/10.1155/IJMMS.2005.1327
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.
ISSN:0161-1712
1687-0425