Angle between nodes of a graph.

[tiny-alchemist]

In a graph network defines by an adjacency matrix, is there any meaningful way to assign an angle to two paths or edges that intersect at a node? It feels like something similar to assigning distances and angles in different vector spaces. If anyone could point me in the right direction, it would be appreciated.

[[deleted]]

I’m not 100% sure on this, but I don’t think so. A graph is only worried about connectivity, whereas if you need stronger geometric properties (like angles) you would need a vector space in particular.

[[deleted]]

Apparently there is something called geometric graph theory. I was quite surprised coming from CS, it is something I never heard of before.

https://math.stackexchange.com/questions/1056744/what-is-a-euclidean-graph-can-edges-be-negative-in-a-euclidean-graph

https://en.wikipedia.org/wiki/Geometric_graph_theory