Template:Did you know nominations/Graph power
< Template:Did you know nominations
Jump to navigation
Jump to search
Revision as of 17:13, 25 February 2013 by imported>Carabinieri (re)
| 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).
Could this say, "in the context of graph theory, ...", or otherwise have an introduction? I think this disclaimer would be helpful because common words including "distance" and "adjacent" are being used in an odd technical way. I cannot understand this statement as it is presented but it gave me the impression that it was making a non-technical claim. Blue Rasberry (talk) 14:36, 25 February 2013 (UTC)
- That ambiguity is kind of what I was going for. It's hard to write an interesting hook about a mathematical subject, so that was my best shot.--Carabinieri (talk) 17:13, 25 February 2013 (UTC)