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.
ISSN 1656-1996 (Print)
Copyright © 2024 KITE E-Learning Solutions | Exclusively distributed by CE-Logic | Terms and Conditions
Philippine E-Journals