Isomorphism of Strongly Regular Graphs
Isomorphism of Strongly Regular Graphs
The book Isomorphism of Strongly Regular Graphs was written by author Here you can read free online of Isomorphism of Strongly Regular Graphs book, rate and share your impressions in comments. If you don't know what to write, just answer the question: Why is Isomorphism of Strongly Regular Graphs a good or bad book?
Where can I read Isomorphism of Strongly Regular Graphs for free?
In our eReader you can find the full English version of the book. Read Isomorphism of Strongly Regular Graphs Online - link to read the book on full screen. Our eReader also allows you to upload and read Pdf, Txt, ePub and fb2 books. In the Mini eReder on the page below you can quickly view all pages of the book - Read Book Isomorphism of Strongly Regular Graphs
In our eReader you can find the full English version of the book. Read Isomorphism of Strongly Regular Graphs Online - link to read the book on full screen. Our eReader also allows you to upload and read Pdf, Txt, ePub and fb2 books. In the Mini eReder on the page below you can quickly view all pages of the book - Read Book Isomorphism of Strongly Regular Graphs
What reading level is Isomorphism of Strongly Regular Graphs book?
To quickly assess the difficulty of the text, read a short excerpt:
63 March 1983 NEW YORK UNIVERSITY Department of Computer Science Courant Institute of Mathematical Sciences 251 MERCER STREET. NEW YORK, N. Y. 10012 Isomorphism of Strongly Regular Graphs by Richard Cole Technical Report No. 6 3 March 19 8 3 ^y Abstract We present isonorphism algorithms for k-strongly regular graphs running faster the larger k. A consequence of our proof is that no "interesting" graph is (d log n) -transitive, for some constant d.
What to read after Isomorphism of Strongly Regula...r Graphs?
You can find similar books in the "Read Also" column, or choose other free books by Richard Cole to read onlineMoreLess
To quickly assess the difficulty of the text, read a short excerpt:
63 March 1983 NEW YORK UNIVERSITY Department of Computer Science Courant Institute of Mathematical Sciences 251 MERCER STREET. NEW YORK, N. Y. 10012 Isomorphism of Strongly Regular Graphs by Richard Cole Technical Report No. 6 3 March 19 8 3 ^y Abstract We present isonorphism algorithms for k-strongly regular graphs running faster the larger k. A consequence of our proof is that no "interesting" graph is (d log n) -transitive, for some constant d.
What to read after Isomorphism of Strongly Regula...r Graphs?
You can find similar books in the "Read Also" column, or choose other free books by Richard Cole to read onlineMoreLess
10
Tokens
Write Review:
User Reviews: