The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(i j)) consisting of all graph distances from vertex v_i to vertex v_j. The distance matrix for graphs was introduced by Graham and Pollak. The mean of all distances in a (connected) graph is known as the graph's mean distance. The maximum value of all distance matrix elements is known as the graph diameter. The characteristic polynomial of the graph distance matrix is known as the distance polynomial.
all-pairs shortest path | antipodal graph | Bellman-Ford algorithm | detour matrix | Dijkstra's algorithm | distance polynomial | Floyd-Warshall algorithm | geodetic graph | graph diameter | graph distance | graph geodesic | Harary index | longest path | mean distance | shortest path | shortest path problem
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.
Club Z! has connected me with a tutor through their online platform! This was exactly the one-on-one attention I needed for my math exam. I was very pleased with the sessions and ClubZ’s online tutoring interface.
My son was suffering from low confidence in his educational abilities. I was in need of help and quick. Club Z! assigned Charlotte (our tutor) and we love her! My son’s grades went from D’s to A’s and B’s.
I’ve been using Club Z’s online classrooms to receive some help and tutoring for 2 of my college classes. I must say that I am very impressed by the functionality and ease of use of their online App. Working online with my tutor has been a piece of cake. Thanks Z.
Jonathan is doing really well in all of his classes this semester, 5 A’s & 2 B’s (he has a computer essentials class instead of PLC). In his Algebra class that Nathan is helping him with he has an A+.
Sarah is very positive, enthusiastic and encourages my daughter to do better each time she comes. My daughter’s grade has improved, we are very grateful for Sarah and that she is tutoring our daughter. Way to go ClubZ!
