Question

Let G = (V(G), E(G)) be a graph, whereV (G) = (1,2,3,4), E(G) = {(1,2), (1,3), (3,2), (1.4)) Find Laplacian matrix of a graph G.​

Answer 1

Answer:

Fred E. Szabo PhD, in The Linear Algebra Survival Guide, 2015

Adjacency Matrix

The adjacency matrix of a simple labeled graph is the matrix A with A[[i,j]] or 0 according to whether the vertex vj, is adjacent to the vertex vj or not. For simple graphs without self-loops, the adjacency matrix has 0 s on the diagonal. For undirected graphs, the adjacency matrix is symmetric.

Illustration