Q.an n-vertex graph is a scorpion if it has a vertex of degree one(the sting)connected to a vertex of degree two(the tail) connected a vertex of degree n-2(the body) connected to the other n-3 (the feet). some of the feet may be connected to other feet. Design an algorithm that decides whether a given adjacency matrix represents a scorpian by examining only O(n) entries.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
