Photo by emileseguin from unsplash
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 ⩽… Click to show full 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 ⩾ k + 5) with the minimal least eigenvalue.
Keywords:
least eigenvalue;
eigenvalue connected;
minimal least;
graphs order;
order size;
connected graphs
Journal Title: Frontiers of Mathematics in China
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Frontiers of Mathematics in China
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!