On the time required to recognize properties of graphs from their adjacency matrices
Journées algorithmiques, Astérisque, no. 38-39 (1976), p. 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},
     author = {Collectif},
     series = {Ast\'erisque},
     publisher = {Soci\'et\'e math\'ematique de France},
     number = {38-39},
     year = {1976},
     pages = {213-227},
     zbl = {0358.68078},
     mrnumber = {460172},
     language = {en},
     url = {http://www.numdam.org/item/AST_1976__38-39__213_0}
}
Rivest, Ronald L.; Vuillemin, Jean. On the time required to recognize properties of graphs from their adjacency matrices, in Journées algorithmiques, Astérisque, no. 38-39 (1976), pp. 213-227. http://www.numdam.org/item/AST_1976__38-39__213_0/

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

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

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

[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).