Spectral conditions for the existence of specified paths and cycles in graphs

preprint2013arXivOpen access

Let $G$ be a graph with $n$ vertices and $λ_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 pathes or cycles and determine the extremal graphs. This result gives spectral conditions for the existence of specified paths and cycles in graphs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Spectral conditions for the existence of specified paths and cycles in graphs

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0