Number of Nodes within a Given Distance from a Node

228 Views Asked by At

Suppose we are given a $d$-regular graph $G=(V,E)$ of order $n$. Let $\lambda_2$ be the second-largest eigenvalue of $G$'s adjacency matrix. Does this information help obtaining a lowerbound or upperbound on the number of nodes within a distance at most $k$ from an arbitrary node $v$?