Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-14T05:06:49.351Z Has data issue: false hasContentIssue false
  • English
  • Français

A Note on p-Cyclic Matrices and Digraphs

Published online by Cambridge University Press:  20 November 2018

B. R. Heap  and
M. S Lynn
B. R. Heap
Affiliation:
Mathematics Division, National Physical Laboratory, Teddington, Middlesex, England
M. S Lynn
Affiliation:
IBM Scientific Centre, 6900 Fannin, Houston, Texas 77025
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We use the terminology of [1]. Let D be a strongly connected digraph on n points and containing m lines, and let A = A(D) be the corresponding adjacency matrix, so that A is an n x n 0-1 matrix containing m unit elements. We recall that A and D are said to be p-cyclic if p is the greatest 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 note we make the latter and related statements precise.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 10 , Issue 4 , October 1967 , pp. 497 - 501
Copyright
Copyright © Canadian Mathematical Society 1967

References

1. Harary, F., Norman, R. Z. and Cartwright, D.: Structural models: an introduction to the theory of directed graphs, Wiley, New, 1965.Google Scholar