Recommendations
Cites work
- scientific article; zbMATH DE number 3238347 (Why is no real title available?)
- scientific article; zbMATH DE number 3091887 (Why is no real title available?)
- A new adjacency matrix for finite graphs
- A spinorial formulation of the maximum clique problem of a graph
- Clifford algebras and spinors.
- Cohomology in the pure spinor formalism for the superstring
- Nilpotent adjacency matrices and random graphs.
- Nilpotent adjacency matrices, random graphs and quantum random variables
- On computational complexity of Clifford algebra
- Spinor approach to the rotation and reflection groups
Cited in
(7)- Hamiltonian cycle enumeration via fermion-zeon convolution
- Kravchuk matrices and induced operators on Clifford algebras
- Clifford algebras, random graphs, and quantum random variables
- Zeons, orthozeons, and graph colorings
- Laplace and Dirac operators on graphs
- Zeon and idem-Clifford formulations of Boolean satisfiability
- A spinorial formulation of the maximum clique problem of a graph
This page was built for publication: Spinorial formulations of graph problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q430733)