Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Completely Positive formulation of the Graph Isomorphism Problem (1301.2390v1)

Published 11 Jan 2013 in cs.DS and math.CO

Abstract: Given two graphs $G_1$ and $G_2$ on $n$ vertices each, we define a graph $G$ on vertex set $V_1\times V_2$ and the edge set as the union of edges of $G_1\times \bar{G_2}$, $\bar{G_1}\times G_2$, ${(v,u'),(v,u"))(|u',u"\in V_2}$ for each $v\in V_1$, and ${((u',v),(u",v))|u',u"\in V_1}$ for each $v\in V_2$. We consider the completely-positive Lov\'asz $\vartheta$ function, i.e., $cp\vartheta$ function for $G$. We show that the function evaluates to $n$ whenever $G_1$ and $G_2$ are isomorphic and to less than $n-1/(4n4)$ when non-isomorphic. Hence this function provides a test for graph isomorphism. We also provide some geometric insight into the feasible region of the completely positive program.

Citations (1)

Summary

We haven't generated a summary for this paper yet.