A Spinorial Formulation of the Maximum Clique Problem of a Graph

Details A Spinorial Formulation of the Maximum Clique Problem of a Graph A Spinorial Formulation of the Maximum Clique Problem of a Graph

2006-03-27

arxiv.org/abs/math-ph/0603068v1

J. Math. Phys. 47, 043502 (2006)

Physics

Mathematical Physics

Scientific paper

10.1063/1.2186256

We present a new formulation of the maximum clique problem of a graph in complex space. We start observing that the adjacency matrix A of a graph can always be written in the form A = B B where B is a complex, symmetric matrix formed by vectors of zero length (null vectors) and the maximum clique problem can be transformed in a geometrical problem for these vectors. This problem, in turn, is translated in spinorial language and we show that each graph uniquely identifies a set of pure spinors, that is vectors of the endomorphism space of Clifford algebras, and the maximum clique problem is formalized in this setting so that, this much studied problem, may take advantage from recent progresses of pure spinor geometry.

Affiliated with

Also associated with

No associations

Rating

A Spinorial Formulation of the Maximum Clique Problem of a Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Spinorial Formulation of the Maximum Clique Problem of a Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Spinorial Formulation of the Maximum Clique Problem of a Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-413678