Sign In

Login

Password

Forgot Password ? Sign Up

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
69th place
59th place
1harvard.edu
18th place
17th place
1doi.org
2nd place
2nd place
1semanticscholar.org
11th place
8th place
1wolfram.com
513th place
537th place
1web.archive.org
1st place
1st place

arxiv.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

doi.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

harvard.edu

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

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

  • 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

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