The complete product of annihilatingly unique digraphs

C. S. Gan

International Journal of Mathematics and Mathematical Sciences, 2005, vol. 2005, 1-5

Abstract:

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.

Date: 2005
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2005/850178.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2005/850178.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:850178

DOI: 10.1155/IJMMS.2005.1327

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().