Background: A graph consists of vertices and edges. An edge is an unordered pair of vertices. Two vertices are adjacent if they appear in some edge of the graph.
In this example, vertex 1 and 2 are adjacent while 1 and 4 are not. The degree of a vertex is the number of edges adjacent to the vertex. In this example, the vertex degrees are 2, 3, 3, 2. In the mathematical field of graph theory, the Laplacian matrix of a graph with n vertices is an n×n matrix L:=(lij) defined as
lij:=⎩⎨⎧degree of vertex i−10if i=jif i=j and vertex i is adjacent to vertex jotherwise.
Problem 1: Find the Laplacian matrix Q for the example kite graph G and calculate its determinant, (1,1)-cofactor and (1,2)-cofactor.
Solution: According to the definition of the Laplacian matrix,
Q=2−1−10−13−1−1−1−13−10−1−12.
The row replacements in row 1, 2, 3 do not change the determinant:
detQ=2−1−10−13−1−1−1−13−10−1−12=2−1−10+2−1−1−13−1−1−1+3−1−1−13−1−1+3−10−1−12+0−1−1=2−1−10−13−10−1−1300−1−10=0.
The (1,1)-cofactor is