68 search results - page 9 / 14 » Symplectic graphs and their automorphisms |
DM
2007
14 years 9 months ago
2007
By a regular embedding of a graph K into a surface we mean a 2-cell embedding of K into a compact connected surface with the automorphism group acting regularly on flags. Regular...
EJC
2007
14 years 9 months ago
2007
The cone ˆG of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the red...
JGT
2007
14 years 9 months ago
2007
: A (directed) cycle C in a graph is called consistent provided there exists an automorphism of , acting as a 1-step rotation of C. A beautiful but not well-known result of J.H. Co...
83
Voted
FOCS
2000
IEEE
15 years 1 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
94
Voted
CSR
2009
Springer
15 years 4 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...