On the time required to recognize properties of graphs from their adjacency matrices
Journées algorithmiques, Astérisque, no. 38-39 (1976), pp. 213-227 
@incollection{AST_1976__38-39__213_0,
     author = {Rivest, Ronald L. and Vuillemin, Jean},
     title = {On the time required to recognize properties of graphs from their adjacency matrices},
     booktitle = {Journ\'ees algorithmiques},
     series = {Ast\'erisque},
     pages = {213--227},
     year = {1976},
     publisher = {Soci\'et\'e math\'ematique de France},
     number = {38-39},
     mrnumber = {460172},
     zbl = {0358.68078},
     language = {en},
     url = {https://www.numdam.org/item/AST_1976__38-39__213_0/}
}
TY  - CHAP
AU  - Rivest, Ronald L.
AU  - Vuillemin, Jean
TI  - On the time required to recognize properties of graphs from their adjacency matrices
BT  - Journées algorithmiques
AU  - Collectif
T3  - Astérisque
PY  - 1976
SP  - 213
EP  - 227
IS  - 38-39
PB  - Société mathématique de France
UR  - https://www.numdam.org/item/AST_1976__38-39__213_0/
LA  - en
ID  - AST_1976__38-39__213_0
ER  - 
%0 Book Section
%A Rivest, Ronald L.
%A Vuillemin, Jean
%T On the time required to recognize properties of graphs from their adjacency matrices
%B Journées algorithmiques
%A Collectif
%S Astérisque
%D 1976
%P 213-227
%N 38-39
%I Société mathématique de France
%U https://www.numdam.org/item/AST_1976__38-39__213_0/
%G en
%F AST_1976__38-39__213_0
Rivest, Ronald L.; Vuillemin, Jean. On the time required to recognize properties of graphs from their adjacency matrices, dans Journées algorithmiques, Astérisque, no. 38-39 (1976), pp. 213-227. https://www.numdam.org/item/AST_1976__38-39__213_0/

[1] Berge, C., Théorie des Graphes. Dunod, Paris (1958). | MR

[2] Biggs, N., Finite Groups of Automorphisms. London Mathematical Society Lecture Note Series 6, Cambridge University Press (1971). | MR | Zbl

[3] Harary, F., Graph Theory. Addison Wesley (1969). | MR | Zbl

[4] Rivest, R. and Vuillemin, J., "On the number of argument evaluations required to compute Boolean functions," Memorandum ERL M-472, Computer Science Division, University of California, Berkeley (Oct. 1974).

[5] Rosenberg, A. L., "On the time required to recognize properties of graphs; a problem," SIGACT News 5 (1973).