Summary: A tricyclic graph is a connected graph in which the number of edges equals the number of vertices plus two. This paper characterizes the unique graph with the minimum least eigenvalue among all connected tricyclic graphs of order \(n\).