A graph has exactly two main eigenvalues if and only if it is a 2-walk linear graph. In this paper, we show some necessary conditions that a 2-walk (a, b)-linear graph must obey. Using these conditions and some basic theorems in graph theory, we characterize all 2-walk linear graphs with small cyclic graphs without pendants. The results are given in sort on unicyclic, bicyclic, tricyclic graphs. © 2010 Wuhan...