DMCA
On Digraphs with Non-derogatory Adjacency Matrix (1998)
Cached
Download Links
by
C. L. Deng
,
C. S. Gan
| Venue: | BULLETIN OF THE MALAYSIAN MATHEMATICAL SOCIETY |
| Citations: | 1 - 0 self |
BibTeX
@MISC{Deng98ondigraphs,
author = {C. L. Deng and C. S. Gan},
title = { On Digraphs with Non-derogatory Adjacency Matrix},
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Let G be a digraph with n vertices and A(G) be its adjacency matrix. A monic polynomial f(x) of degree at most n is called an annihilating polynomial of G if.0))( ( =GAf G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. We prove that two families of digraphs, i.e., the ladder digraphs and the difans, are annihilatingly unique by studying the similarity invariants of their adjacency matrices respectively.
