Scribd
Upload
150 views2 pages

Graph Theory Homework Solutions

This document contains four homework problems related to complex systems and physics: 1. Draw graphs to show properties of planar and acyclic graphs. 2. Show that the eigenvalues of an acyclic digraph are all zero, and use this to show a graph is acyclic if all eigenvalues of its adjacency matrix are zero. 3. Determine the lowest eigenvalue and eigenvector of the Laplacian of a connected undirected graph, and show the algebraic connectivity is the second smallest eigenvalue. 4. Show the sum of weights of all paths between two vertices in a graph is given by an element of a matrix, and use this to determine the length of a geodesic path between the vertices.

Uploaded by

Trevor feignardd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
150 views2 pages

Graph Theory Homework Solutions

This document contains four homework problems related to complex systems and physics: 1. Draw graphs to show properties of planar and acyclic graphs. 2. Show that the eigenvalues of an acyclic digraph are all zero, and use this to show a graph is acyclic if all eigenvalues of its adjacency matrix are zero. 3. Determine the lowest eigenvalue and eigenvector of the Laplacian of a connected undirected graph, and show the algebraic connectivity is the second smallest eigenvalue. 4. Show the sum of weights of all paths between two vertices in a graph is given by an element of a matrix, and use this to determine the length of a geodesic path between the vertices.

Uploaded by

Trevor feignardd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Complex Systems 535/Physics 508: Homework 1

1. Planar and acyclic graphs: Here are three small graphs, one undirected, another directed, and
the third bipartite:

(a) (b)
2 3
1

5
4 6

7 8 9

(c)

Draw figures showing the following:

(i) that graph (a) is not planar;


(ii) that graph (b) is not cyclic;
(iii) the bibliographic coupling graph of (b);
(iv) the two one-mode projections of (c).

2. Eigenvalues of an acyclic digraph: Consider an acyclic digraph with no self-edges (i.e., no edges
connecting vertices to themselves). We showed in class that the adjacency matrix of such a graph
can be written in upper triangular form by a suitable labeling of the vertices.

(i) Show that all eigenvalues of the adjacency matrix of such an acyclic digraph are zero.
(ii) Write down an expression for the number of closed loops of length r in a graph in terms of
the eigenvalues of the adjacency matrix.
(iii) Hence, or otherwise, show (conversely) that if all eigenvalues of the adjacency matrix are
zero the graph must be acyclic.

1
3. Lowest eigenvalue of the Laplacian: Consider a connected graph (i.e., every vertex is reachable
from every other) which is undirected with Laplacian L D A. 
(i) What is the lowest eigenvalue of L and what is the corresponding eigenvector?
(ii) How many rows of the Laplacian are linearly independent?
(iii) Show that an undirected graph is connected if and only if λ2
 0, where λ2 is the second-
smallest eigenvalue of the Laplacian.

The eigenvalue λ2 is called the algebraic connectivity of the graph, and will come up repeatedly
in our study of networks.

4. Geodesic paths and the adjacency matrix: Consider the set of all paths from vertex s to vertex t
on an undirected graph with adjacency matrix A. Let us give each path a weight equal to α r , where
r is the length of the path.

st element of the matrix Z  


(i) Show that the sum of the weights of all the paths from s to t is given by Z st , which is the

I αA 1 . What condition must α satisfy for the sum to
converge?
(ii) Hence, or otherwise, show that the length  st of a geodesic path from s to t, if there is one, is

 st lim
α
∂ log Zst
0 ∂ log α

You might also like