GraphResolvingSets
Documentation for GraphResolvingSets.
GraphResolvingSets.color_refinementGraphResolvingSets.isomorphism_testGraphResolvingSets.latin_square_graphGraphResolvingSets.resistance_distancesGraphResolvingSets.shortest_path_distances
GraphResolvingSets.color_refinement — Methodcolor_refinement(alg, g)References
- Algorithm 3.1 of Power and Limits of the Weisfeiler-Leman Algorithm (Kiefer, 2020, https://publications.rwth-aachen.de/recoResistanceDistances/785831/files/785831.pdf)
- Equation (3) of Rethinking the Expressive Power of GNNs via Graph Biconnectivity (Zhang et al., 2023, https://arxiv.org/abs/2301.09505)
GraphResolvingSets.isomorphism_test — Methodisomorphism_test(algo, g1, g2)References
Pages 30-31 of Power and Limits of the Weisfeiler-Leman Algorithm (Kiefer, 2020, https://publications.rwth-aachen.de/recoResistanceDistances/785831/files/785831.pdf)
GraphResolvingSets.latin_square_graph — Methodlatin_square_graph(latin_square)Construct the graph associated with a latin square.
References
https://cameroncounts.wordpress.com/2010/08/26/the-shrikhande-graph/
GraphResolvingSets.resistance_distances — Methodresistance_distances(g)Compute the matrix of all-pairs resistance distances using a connection with the graph Laplacian.
References
- Equation 2 of Resistance distance and Laplacian spectrum (Xiao and Gutman, 2003, https://link.springer.com/article/10.1007/s00214-003-0460-4)
GraphResolvingSets.shortest_path_distances — Methodshortest_path_distances(g)Compute the matrix of all-pairs shortest path distances using Johnson's algorithm.