Article ID Journal Published Year Pages File Type
4599125 Linear Algebra and its Applications 2015 7 Pages PDF
Abstract

Let G be a graph with n   vertices and λn(G)λn(G) be the least eigenvalue of its adjacency matrix of G. In this paper, we give sharp bounds on the least eigenvalue of graphs without given paths or cycles and determine the extremal graphs. This result gives spectral conditions for the existence of specified paths and cycles in graphs.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Algebra and Number Theory
Preview
Spectral conditions for the existence of specified paths and cycles in graphs
Authors
, , ,