The complete product of annihilatingly unique digraphs
Author(s) -
C. S. Gan
Publication year - 2005
Publication title -
international journal of mathematics and mathematical sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 39
eISSN - 1687-0425
pISSN - 0161-1712
DOI - 10.1155/ijmms.2005.1327
Subject(s) - algorithm , computer science
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom