A fact from Graph power appeared on Wikipedia's Main Page in the Did you know column on 4 March 2013 ( check views). The text of the entry was as follows: Did you know... that in the square of a graph, all vertices with a distance of no more than two in the original graph are adjacent? A record of the entry may be seen at Wikipedia:Recent additions/2013/March. The nomination discussion and review may be seen at Template:Did you know nominations/Graph power.

This article is rated B-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Mathematics Mid‑priority This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles Mid This article has been rated as Mid-priority on the project's priority scale. Computer science Mid‑importance This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles Mid This article has been rated as Mid-importance on the project's importance scale. Things you can help WikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{ WikiProject Computer science}}

Any references? If vertex A->B is weight a and vertex B->C is weight b, then the new edge A->C should be weight a+b?

Darcourse ( talk) 16:48, 22 April 2020 (UTC) reply

I was wondering the same thing myself. I think the logical extension is that the weight of the edge A->C should be the minimum of weight(A->V) + weight(V->C) for all vertices V in the graph. If in your example, the only path from A to C is through B, then this minimum would be a+b as you say.

This definition happens to be a tropical matrix power. -- Saforrest ( talk) 11:11, 27 July 2020 (UTC) reply