Distance (graph theory) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Distance (graph theory)" in English language version.

refsWebsite

Global rank English rank

1arxiv.org

69^th place

59^th place

1harvard.edu

18^th place

17^th place

1doi.org

2^nd place

1semanticscholar.org

11^th place

8^th place

1wolfram.com

513^th place

537^th place

1web.archive.org

1^st place

arxiv.org (Global: 69^th place; English: 59^th place)

Bouttier, Jérémie; Di Francesco, P.; Guitter, E. (July 2003). "Geodesic distance in planar graphs". Nuclear Physics B. 663 (3): 535–567. arXiv:cond-mat/0303272. Bibcode:2003NuPhB.663..535B. doi:10.1016/S0550-3213(03)00355-9. S2CID 119594729. By distance we mean here geodesic distance along the graph, namely the length of any shortest path between say two given faces

doi.org (Global: 2^nd place; English: 2^nd place)

Bouttier, Jérémie; Di Francesco, P.; Guitter, E. (July 2003). "Geodesic distance in planar graphs". Nuclear Physics B. 663 (3): 535–567. arXiv:cond-mat/0303272. Bibcode:2003NuPhB.663..535B. doi:10.1016/S0550-3213(03)00355-9. S2CID 119594729. By distance we mean here geodesic distance along the graph, namely the length of any shortest path between say two given faces

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Bouttier, Jérémie; Di Francesco, P.; Guitter, E. (July 2003). "Geodesic distance in planar graphs". Nuclear Physics B. 663 (3): 535–567. arXiv:cond-mat/0303272. Bibcode:2003NuPhB.663..535B. doi:10.1016/S0550-3213(03)00355-9. S2CID 119594729. By distance we mean here geodesic distance along the graph, namely the length of any shortest path between say two given faces

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Bouttier, Jérémie; Di Francesco, P.; Guitter, E. (July 2003). "Geodesic distance in planar graphs". Nuclear Physics B. 663 (3): 535–567. arXiv:cond-mat/0303272. Bibcode:2003NuPhB.663..535B. doi:10.1016/S0550-3213(03)00355-9. S2CID 119594729. By distance we mean here geodesic distance along the graph, namely the length of any shortest path between say two given faces

web.archive.org (Global: 1^st place; English: 1^st place)

Weisstein, Eric W. "Graph Geodesic". MathWorld--A Wolfram Web Resource. Wolfram Research. Archived from the original on 2008-04-23. Retrieved 2008-04-23. The length of the graph geodesic between these points d(u,v) is called the graph distance between u and v

wolfram.com (Global: 513^th place; English: 537^th place)

mathworld.wolfram.com

Weisstein, Eric W. "Graph Geodesic". MathWorld--A Wolfram Web Resource. Wolfram Research. Archived from the original on 2008-04-23. Retrieved 2008-04-23. The length of the graph geodesic between these points d(u,v) is called the graph distance between u and v

Distance (graph theory) (English Wikipedia)

arxiv.org (Global: 69th place; English: 59th place)

doi.org (Global: 2nd place; English: 2nd place)

harvard.edu (Global: 18th place; English: 17th place)