Template:Did you know nominations/Graph power

The following is an archived discussion of Graph power's DYK nomination. Please do not modify this page. Subsequent comments should be made on the appropriate discussion page; such as this archived nomination"s (talk) page, the nominated article's (talk) page, or the Did you know (talk) page. Unless there is consensus to re-open the archived discussion here. No further edits should be made to this page. See the talk page guidelines for (more) information.

The result was: promoted by Casliber (talk · contribs) 10:10, 3 March 2013 (UTC).

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)

Article created on February 23, 2013 with 2,591 characters readable prose size as of today. Hook supported by inline citation at the end of first paragraph. The hook awoke my interest although the actual subject is way over my head. I added image found in Commons with summary: "a picture is worth a thousand words". Good to go. Poeticbent talk 19:58, 2 March 2013 (UTC)
- Thanks for the interest. There's now a different image that more specifically illustrates the concept in the hook, but unfortunately I don't think it's legible enough at 100px to use in DYK. —David Eppstein (talk) 05:08, 3 March 2013 (UTC)