Voir la notice de l'article provenant de la source Cambridge University Press
Bridges, W. G. A Class of Normal (0, 1)-Matrices. Canadian journal of mathematics, Tome 25 (1973) no. 3, pp. 621-626. doi: 10.4153/CJM-1973-063-6
@article{10_4153_CJM_1973_063_6,
author = {Bridges, W. G.},
title = {A {Class} of {Normal} (0, {1)-Matrices}},
journal = {Canadian journal of mathematics},
pages = {621--626},
year = {1973},
volume = {25},
number = {3},
doi = {10.4153/CJM-1973-063-6},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1973-063-6/}
}
[1] 1. Bridges, W. G., The polynomial of a non-regular digraph, Pacific J. Math. 38 (1971), 325–342. Google Scholar
[2] 2. Hall, M., Jr., Combinatorial theory (Blaisdell, Waltham, Mass., 1967). Google Scholar
[3] 3. Hoffman, A. J., On the polynomial of a graph, Amer. Math. Monthly 70 (1963), 30–36. Google Scholar
[4] 4. Hoffman, A. J. and McAndrew, M. H., On the polynomial of a directed graph, Proc. Amer. Math. Soc. 10 (1965), 303–309. Google Scholar
[5] 5. Hoffman, A. J. and Singleton, R. R., On Moore graphs of diameter 2 and 3, IBM J. Res. Develop. 4 (1960), 497–504. Google Scholar
[6] 6. Ryser, H. J., A generalization of the matrix equation A2 = J, Linear Algebra and Appl. 3 (1970), 451–460. Google Scholar
[7] 7. Seidel, J. J., Strongly regular graphs with ( — 1, 1, 0) adjacency matrix having eigenvalue 3, Linear Algebra and Appl. 1 (1968), 281–298. Google Scholar
Cité par Sources :