Graphs With Least Eigenvalue—2: A New Proof of the 31...

Designs, Codes and Cryptography 2005 / 02-03 Vol. 34; Iss. 2-3

Graphs With Least Eigenvalue—2: A New Proof of the 31 Forbidden Subgraphs Theorem

Dragoš Cvetković, Peter Rowlinson, Slobodan K. Simić
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
34
Language:
english
Pages:
12
Journal:
Designs, Codes and Cryptography
DOI:
10.1007/s10623-004-4856-5
Date:
February, 2005
File:
PDF, 310 KB
english, 2005
Conversion to is in progress
Conversion to is failed