Spinorial formulations of graph problems

DOI10.1007/S00006-011-0298-0zbMath1266.15036OpenAlexW2095129445MaRDI QIDQ430733

J. Herrera, H. S. Yoon

Publication date: 26 June 2012

Published in: Advances in Applied Clifford Algebras (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00006-011-0298-0

zbMATH Keywords

cyclesspinorsgraphsClifford algebramatchingscliquesquantum probabilityfinite graphFock subspacespinor polynomialsspinor space

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Clifford algebras, spinors (15A66)

Related Items (5)

Zeons, orthozeons, and graph colorings ⋮ Laplace and Dirac operators on graphs ⋮ Hamiltonian cycle enumeration via fermion-zeon convolution ⋮ Zeon and idem-Clifford formulations of Boolean satisfiability ⋮ Kravchuk matrices and induced operators on Clifford algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new adjacency matrix for finite graphs
• A spinorial formulation of the maximum clique problem of a graph
• On computational complexity of Clifford algebra
• Spinor approach to the rotation and reflection groups
• Nilpotent adjacency matrices, random graphs and quantum random variables
• Cohomology in the pure spinor formalism for the superstring

This page was built for publication: Spinorial formulations of graph problems