Minimal least eigenvalue of connected graphs of order n and size m = n + k (5 ⩽ k ⩽ 8)
Sign Up to like & getrecommendations! Published in 2019 at "Frontiers of Mathematics in China"
DOI: 10.1007/s11464-019-0805-5
Abstract: The least eigenvalue of a connected graph is the least eigenvalue of its adjacency matrix. We characterize the connected graphs of order n and size n + k (5 ⩽ k ⩽ 8 and n… read more here.
Keywords: least eigenvalue; eigenvalue connected; minimal least; graphs order ... See more keywords