2·
4 months agoGraphs don’t have vectors, spaces do. A space is just an n-dimensional “graph”. Vectors written in columns next to each other are matrices. Matrices can describe transformation of space, and if the transformation is linear (straight lines stay straight) there will be some vectors that stay the same (unaffected by the transformation). These are called eigenvectors.
I misunderstood a little, I assumed a function graph, which could be R^n space. But for the graph-theory-graphs (sets of vertices and edges) it’s similar, you can model the graph using adjacency matrix (NxN matrix for a graph of N vertices, where the vertices ‘mapped’ to a row and column by index. Usually consisting of real numbers representing distance between the “row” and “column” node) and look at it from the linear algebra point of view. That allows to model some characteristics of the graph. But honestly I haven’t mixed these two fields of maths much, so I hope what I wrote is somewhat understandable.