Abstract

A necessary condition for the existence of long cycles in a graph involving the Laplacian spectrum of graphs is derived. It is based on two theorems which relate the eigenvalues of a graph and the eigenvalues of its induced subgraphs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call