Abstract
Beginning with an arbitrary finite graph, various spinor spaces are constructed within Clifford algebras of appropriate dimension. Properties of spinors within these spaces then reveal information about the structure of the graph. Spinor polynomials are introduced and the notions of degrees of polynomials and Fock subspace dimensions are tied together with matchings, cliques, independent sets, and cycle covers of arbitrary finite graphs. In particular, matchings, independent sets, cliques, cycle covers, and cycles of arbitrary length are all enumerated by dimensions of spinor subspaces, while sizes of maximal cliques and independent sets are revealed by degrees of spinor polynomials. The spinor adjacency operator is introduced and used to enumerate cycles of arbitrary length and to compute graph circumference and girth.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
