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...
Saved in:
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!
|
Similar Items
-
Fixation Probabilities on Complete Star and Bipartite Digraphs
by: Chunming Zhang, et al.
Published: (2012-01-01) -
Digraphs : theory, algorithms, and applications /
by: Bang-Jensen, Jørgen, 1960-
Published: (2009) -
Annihilators of nilpotent elements
by: Abraham A. Klein
Published: (2005-01-01) -
Annihilating polynomials for quadratic forms
by: David W. Lewis
Published: (2001-01-01) -
Uniqueness of Complete Hypersurfaces in Weighted Riemannian Warped Products
by: Ning Zhang
Published: (2021-01-01)