A Note on p-Cyclic Matrices and Digraphs
Canadian mathematical bulletin, Tome 10 (1967) no. 4, pp. 497-501
Voir la notice de l'article provenant de la source Cambridge
We use the terminology of [1]. Let D be a strongly connected digraph on npoints and containing m lines, and let A = A(D) be the correspondingadjacency matrix, so that A is an n x n 0-1 matrix containing m unitelements. We recall that A and D are said to be p-cyclic if p is thegreatest common divisor of the lengths of all directed cycles of D. Clearly,the larger the value of p, the smaller the value of m must be; in this notewe make the latter and related statements precise.
Heap, B. R.; Lynn, M. S. A Note on p-Cyclic Matrices and Digraphs. Canadian mathematical bulletin, Tome 10 (1967) no. 4, pp. 497-501. doi: 10.4153/CMB-1967-047-1
@article{10_4153_CMB_1967_047_1,
author = {Heap, B. R. and Lynn, M. S},
title = {A {Note} on {p-Cyclic} {Matrices} and {Digraphs}},
journal = {Canadian mathematical bulletin},
pages = {497--501},
year = {1967},
volume = {10},
number = {4},
doi = {10.4153/CMB-1967-047-1},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1967-047-1/}
}
Cité par Sources :