arXiv:math/0303084 [math.CO]AbstractReferencesReviewsResources
Graphs of unitary matrices
Published 2003-03-07, updated 2005-12-17Version 3
The support of a matrix M is the (0,1)-matrix with ij-th entry equal to 1 if the ij-th entry of M is non-zero, and equal to 0, otherwise. The digraph whose adjacency matrix is the support of M is said to be the digraph of M. This paper observes some structural properties of digraphs of unitary matrices.
Comments: 19 pages. Accepted for publication in Ars Combinatoria
Related articles: Most relevant | Search more
The triangle-free graphs with rank 6
arXiv:math/0201211 [math.CO] (Published 2002-01-22)
The kernel of the adjacency matrix of a rectangular mesh
State Transfer on Graphs