Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Research in Science, Computing and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.