Internet Archive Scholar

Some Inequalities for the Largest Eigenvalue of a Graph

V. NIKIFOROV
2002 Combinatorics, probability & computing  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (133.3 kB)
https://web.archive.org/web/20190223144248/http://pdfs.semanticscholar.org/4699/906a07b766131f4daa338b2e0ac970399a70.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL. The file type is application/pdf.

Let (G) be the largest eigenvalue of the adjacency matrix of a graph G: We show that if G is K p+1 -free then
doi:10.1017/s0963548301004928 fatcat:yi77kmimxjgzxedouy3v462kzq
Citation

V. NIKIFOROV. "Some Inequalities for the Largest Eigenvalue of a Graph." Combinatorics, probability & computing 11.02 (2002)