Coxeter theory investigates groups generated by reflections and the geometric structures arising from their actions, such as root systems and Dynkin diagrams. This body of work underpins vast areas of ...

Graph matching and edit distance algorithms form a cornerstone of modern computational techniques used to quantify the similarity between structured data. These methods underpin a wide array of ...

A signed bipartite graph G(U,V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident ...

D. Fan, S. Goryainov, X. Huang, H. Lin, The spanning k-trees, perfect matchings and spectral radius of graphs, Linear Multilinear Algebra 70 (2022), 7264–7275. P ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

A couple of weeks ago, I attended and spoke at the first stop in the Neo4j GraphTour in Washington D.C. and I was able to get the best answer yet to a question that I’d been pondering: what’s the ...

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...