Given a matrix A of a strongly $k$ regular graph G(srg($n,k,\lambda,\mu$);$\lambda ,\mu >0;k>3$). The matrix A can be divided into 4 sub matrices based on adjacency of vertex $x \in G$.
$A_x$ is the symmetric matrix of the graph $(G-x)$, where $C$ is the symmetric matrix of the graph created by...
can you try downloading the paper yourself? does it work for you? it seems to time out for me. another academia paper (the one just cited in cs chat room on citation analysis) did download for me.
@Jim the live browse version does not work for me, the pdf download seems to time out, will have to try another computer later, does the pdf download work for you?
@vzn Luks, Eugene M. (1982), "Isomorphism of graphs of bounded valence can be tested in polynomial time", Journal of Computer and System Sciences 25: 42–65, doi:10.1016/0022-0000(82)90009-5 used group theory .
@vzn he used a theorem which is quite sophisticated, if i am not wrong, a theorem which consists 10,000 lines/ pages proof due to thomsons . i have started to study abs alg, so long way to understand luk.
i think traditional thinking will not give "good results", If I am not too bold to say that. whether my approach works or not , it is sure that it is a novel idea. i am confident it provides a complete solution, I am actually worried about complexity .
there is something funky about se. it has lots of stuff on the "big open problems" in QA but nobody actually "actively working" on any of it so to speak.
@Jim do not know too much about specifics of hard cases. but seems one would have to be an expert on them to work in this area. & maybe specialize in attacking one of the hard classes.
have approached another problem SAT in a similar way of creating hard instances & writing code to solve them...
do you want to attack it all theoretically, or (also) empirically? note top researcher McKay is highly applied & very much believes in leveraging the applied side.
@vzn I thought my idea was naive and easy to understand. I planned to post 1 more question, after that I could go for the real work. i posted to get feedback, find related ref: and flaws.nothing happened.
@vzn nobody has pointed out obvious "flaws" because I could not explain it, nobody has clear idea what i am doing (my responsibility ), ok, I should be more grateful , but I was expecting more.
so very sharp ppl who are interested in open problems hang out on se, but they dont "use it" for that purpose. (& furthermore) they will typically discourage it. with good reason...
Given a matrix A of a strongly $k$ regular graph G(srg($n,k,\lambda,\mu$);$\lambda ,\mu >0;k>3$). The matrix A can be divided into 4 sub matrices based on adjacency of vertex $x \in G$.
$A_x$ is the symmetric matrix of the graph $(G-x)$, where $C$ is the symmetric matrix of the graph created by...
