A graph matrix is a matrix associated with a graph , usually with rows and columns indexed by graph vertices ,
graph edges , or both. Graph matrices can encode adjacency,
incidence, vertex degrees , distances, and weighted
variants of these data.
Standard examples include the adjacency matrix , degree matrix , incidence
matrix , Laplacian matrix , and graph
distance matrix . Other examples include the weighted
adjacency matrix and Szeged matrix .
See also ABC Matrix ,
Adjacency Matrix ,
Arithmetic-Geometric Matrix ,
Degree Matrix ,
Detour
Matrix ,
Graph Distance Matrix ,
Incidence
Matrix ,
Laplacian Matrix ,
Path-Szeged
Matrix ,
Randić Matrix ,
Rank
Matrix ,
Rigidity Matrix ,
Sombor
Matrix ,
Szeged Matrix ,
Tournament
Matrix ,
Tutte Matrix ,
Weighted
Adjacency Matrix
Explore with Wolfram|Alpha
References Bapat, R. B. Graphs and Matrices. New Delhi, India: Springer, 2010. Godsil, C. and Royle, G. Algebraic
Graph Theory. New York: Springer-Verlag, 2001.
Cite this as:
Weisstein, Eric W. "Graph Matrix." From
MathWorld --A Wolfram Resource. https://mathworld.wolfram.com/GraphMatrix.html
Subject classifications