A remark on isotopies of digraphs and permutation matrices
Bohdan Zelinka (1977)
Časopis pro pěstování matematiky
Similarity:
Displaying similar documents to “Hall exponents of matrices, tournaments and their line digraphs”
A remark on isotopies of digraphs and permutation matrices
Maximum rank of a power of a matrix of a given pattern
Svatopluk Poljak (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
A note on the number of edges guaranteeing a in Eulerian bipartite digraphs.
Shen, Jian, Yuster, Raphael (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Acyclic digraphs and eigenvalues of -matrices.
McKay, Brendan D., Oggier, Frédérique E., Royle, Gordon F., Sloane, N.J.A., Wanless, Ian M., Wilf, Herbert S. (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Digraphs with large exponent.
Kirkland, S., Olesky, D.D., van den Driessche, P. (2000)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
On digraphs with non-derogatory adjacency matrix.
Deng, C.L., Gan, C.S. (1998)
Bulletin of the Malaysian Mathematical Society. Second Series
Similarity:
On a problem of walks
Charles Delorme, Marie-Claude Heydemann (1999)
Annales de l'institut Fourier
Similarity:
In 1995, F. Jaeger and M.-C. Heydemann began to work on a conjecture on binary operations which are related to homomorphisms of De Bruijn digraphs. For this, they have considered the class of digraphs such that for any integer , has exactly walks of length , where is the order of . Recently, C. Delorme has obtained some results on the original conjecture. The aim of this paper is to recall the conjecture and to report where all the authors arrived.