Geodesic
On the Diameter of a p-Cyclic Strongly Connected Digraph
Canadian journal of mathematics, Tome 20 (1968) no. 1, pp. 749-755

Voir la notice de l'article provenant de la source Cambridge University Press

In this paper we follow the notation of (2). In (5), Luce showed, in other terminology, that if d is the diameter of a strongly connected digraph, D, on n vertices with m edges, then 1.1 this inequality being sharp; from (1.1) one may immediately derive sharp upper bounds for d in terms of m and n, this being a generalization of the obvious and well-known inequality 1.2 
Lynn, M. Stuart. On the Diameter of a p-Cyclic Strongly Connected Digraph. Canadian journal of mathematics, Tome 20 (1968) no. 1, pp. 749-755. doi: 10.4153/CJM-1968-074-2
@article{10_4153_CJM_1968_074_2,
     author = {Lynn, M. Stuart},
     title = {On the {Diameter} of a {p-Cyclic} {Strongly} {Connected} {Digraph}},
     journal = {Canadian journal of mathematics},
     pages = {749--755},
     year = {1968},
     volume = {20},
     number = {1},
     doi = {10.4153/CJM-1968-074-2},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-074-2/}
}
TY  - JOUR
AU  - Lynn, M. Stuart
TI  - On the Diameter of a p-Cyclic Strongly Connected Digraph
JO  - Canadian journal of mathematics
PY  - 1968
SP  - 749
EP  - 755
VL  - 20
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-074-2/
DO  - 10.4153/CJM-1968-074-2
ID  - 10_4153_CJM_1968_074_2
ER  - 
%0 Journal Article
%A Lynn, M. Stuart
%T On the Diameter of a p-Cyclic Strongly Connected Digraph
%J Canadian journal of mathematics
%D 1968
%P 749-755
%V 20
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-074-2/
%R 10.4153/CJM-1968-074-2
%F 10_4153_CJM_1968_074_2

[1] 1. Berge, C., The theory of graphs (Methuen, London, 1962). Google Scholar

[2] 2. Harary, F., Norman, R., and Cartwright, D., Structural models and introduction to the theory of directed graphs (Wiley, New York, 1965). Google Scholar

[3] 3. Heap, B. R. and Lynn, M. S., The index of primitivity of a non-negative matrix, Numer. Math., 6 (1964), 120–141. Google Scholar

[4] 4. Heap, B. R. and Lynn, M. S., To structure of powers of a non-negative matrix. I. The index of convergence, J. Soc. Indust. Appl. Math., 12 (1966). Google Scholar

[5] 5. Luce, R. D., Connectivity and generalized cliques in sociometric group structure, Psychometrika, 15 (1950), 169–190. Google Scholar

Cité par Sources :