HomeJournal Of Research In Science, Computing And Engineeringvol. 3 no. 3 (2006)

Singular and Nonsingular Circulant Graphs

Leonor Aquino-ruivivar

Discipline: Mathematics



A graph G is said to be singular when its adjacency matrix A = A(G) is singular, and circulant when A = A(G) is a circulant matrix. In this study, two classes of circulant graphs are studied, and conditions sufficient for these graphs to be nonsingular are established.