Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Discrimination of Graph Isomorphism Classes by Continuous Spectrum and
  Split Technique   The graph isomorphism problem is a main problem which has numerous
applications in different fields. Thus, finding an efficient and easy to
implement method to discriminate non-isomorphic graphs is valuable. In this
paper, a new method is introduced which is very simple and easy to implement,
but very efficient in discriminating non-isomorphic graphs, in practice. This
method does not need any heuristic attempt and based on the eigenvalues of a
new matrix representation for graphs. It, almost always, separates
non-isomorphic $n$-vertex graphs in time $O(n^3)$ and in worst cases such as
strongly regular graphs, in time $O(n^4)$. Here, we show that this method,
successfully, characterizes the isomorphism classes of studied instances of
strongly regular graphs (up to 64 vertices). Strongly regular graphs are
believed to be hard cases of the graph isomorphism problem.

4
The categories of this paper are: cond-mat
35
The categories of this paper are: mtrl-th
37
The categories of this paper are: supr-con
16
The categories of this paper are: stat
36
The categories of this paper are: cmp-lg
31
The categories of this paper are: ao-sci
15
The categories of this paper are: nucl-ex
24
The categories of this paper are: dg-ga
22
The categories of this paper are: chao-dyn
26
The categories of this paper are: bayes-an
23
The categories of this paper are: solv-int
6
The categories of this paper are: astro-ph
14
The categories of this paper are: math-ph
13
The categories of this paper are: quant-ph
0
The categories of this paper are: hep-ph
3
The categories of this paper are: physics