If all the Seidel eigenvalues of the graph G are integers, then G is called a Seidel integer graph. In this paper, we apply methods from algebraic and matrix theory to obtain the Seidel eigenvalue ...

Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective by Andreas Rothe, Institute of Science and Technology Austria Editors' notes ...

It’s often assumed that Dijkstra’s algorithm, or the A* graph traversal algorithm is used, but the reality is that although these pure graph theory algorithms are decidedly influential, they ...

Given a graph consisting N nodes (labelled 1 to N) where a specific given node S represents the starting position S and an edge between two nodes is of a given length, which may or may not be equal to ...

We propose shortest path algorithms that use A* search in combination with a new graph-theoretic lower-bounding technique based on landmarks and the triangle inequality. Our algorithms compute optimal ...

The Single-Source Shortest Path problem (SSSP), known as the basis of many application areas, is a fundamental matter in graph theory. In this paper, a new efficient algorithm named Li-Qi (LQ) is ...

Graph Theoretical Measures Global and nodal topological properties, including cluster coefficient, global efficiency, the shortest path length, local efficiency, nodal efficiency, nodal local ...

Graph theory isn’t enough. The mathematical language for talking about connections, which usually depends on networks — vertices (dots) and edges (lines connecting them) — has been an invaluable way ...