  In this paper, we consider continuous-time quantum walks (CTQWs) on finite
graphs determined by the Laplacian matrices. By introducing fully
interconnected graph decomposition of given graphs, we show a decomposition
method for the Laplacian matrices. Using the decomposition method, we show
several conditions for graph structure which return probability of CTQW tends
to 1 while the number of vertices tends to infinity.
