In this paper, we implement a technique based on spanning elementary subgraphs of a given graph to compute the determinant of cycle book graphs. In addition, a characterization of nonsingular cycle book graphs is given based on the length of the cycles.
