Displaying similar documents to “A note on the asymptotic and computational complexity of graph distinguishability.”

Note: The Smallest Nonevasive Graph Property

Michał Adamaszek (2014)

Discussiones Mathematicae Graph Theory


A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form “is there an edge between vertices u and v” requires, in the worst case, to ask about all pairs of vertices. Most “natural” graph properties are either evasive or conjectured to be such, and of the few examples of nontrivial nonevasive properties scattered in the literature the smallest one has n = 6. We exhibit a nontrivial, nonevasive property of 5-vertex graphs...

Symmetry breaking in graphs.

Albertson, Michael O., Collins, Karen L. (1996)

The Electronic Journal of Combinatorics [electronic only]