Abstract
We introduce an antipodality relation in a graph and search for an antipodal vertex. We also give a randomized algorithm for solving the oracle problem for a symmetric Cayley graph over the group ℤ2n when the number of queries to the oracle is polynomial in the vertex degree.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have