The normalized Laplacian eigenvalues of a network play an important role in its structural and dynamical aspects associated with the network. In this paper, we consider how the normalized Laplacian spectral radius of a non-bipartite graph behaves by several graph operations. As an example of the application, the smallest normalized Laplacian spectral radius of non-bipartite unicyclic graphs with fixed order is determined.