Template:Did you know nominations/Graph power
< Template:Did you know nominations
Jump to navigation
Jump to search
Revision as of 20:18, 24 February 2013 by imported>Carabinieri (←Created page with '{{subst:NewDYKnomination | article = Graph power | status = new | hook = ... that in the '''square of a graph''' a...')
| DYK toolbox |
|---|
Graph power
- ... that in the square of a graph all vertices with a distance of no more than two in the original graph are adjacent?
Created by David Eppstein (talk). Nominated by Carabinieri (talk) at 20:18, 24 February 2013 (UTC).