title: Chapter 3 Matrix Tree Theorem icon: file order: 3 author: Krigo category: - MATH tag: - MATH - Graph Theory footer: Thank's myself hardwork. copyrigh: 无版权 date: 2024-05-28
Definition 5.1
IMPORTANT
The algebraic connectivity of is the second smallest eigenvalue, , of the Laplacian matrix . We denote the algebraic connectivty of by .
- is the second smallest eigenvalues.
In Class Test
Find the adjacency matrix, its squire and cube of the following graph .
How many walks from to of length ?
List all such walks one by one.
In Class Test - 18
Calculate all Laplacian eigenpairs of the following graph .
In Class Test
Let be the following graph. Find the characteristic polynomial of . Verify Theorem 1.8.
In Class Test
Find the characteristic polynomial of adjacent matrix of the following graph by Theorem 1.12, 1.14 and 1.17.
In Class Test
Find the characteristic polynomial of adjacent matrix of the following graph by Theorem 1.7, 1.17 and 1.18.
In Class Test
Consider the following graph G and Corollary 1.26. Suppose and . Find the spectrum of the graph.
In Class Test
Consider the following graph . Find in Corollary 1.26 and the spectrum of .