An investigation has been made of the upper bound of the maximum eigenvalue of the Laplacian matrix L(G, d) of the connected graph G arithmetic structure. First the upper bound can be worked out, thus further obtaining a better upper bound .