Scribd
Upload
20 views5 pages

Graph Theory Class Announcement and Concepts

The document outlines important class announcements, including the cancellation of the class on September 1 and office hours for the Math Learning Center. It provides definitions and properties of disconnected graphs, incidence and adjacency matrices, and discusses the structure of complete graphs and isomorphic graphs. Additionally, it highlights the significance of eigenvalues and spectral graph theory in understanding graph properties.

Uploaded by

Peter Man
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
20 views5 pages

Graph Theory Class Announcement and Concepts

The document outlines important class announcements, including the cancellation of the class on September 1 and office hours for the Math Learning Center. It provides definitions and properties of disconnected graphs, incidence and adjacency matrices, and discusses the structure of complete graphs and isomorphic graphs. Additionally, it highlights the significance of eigenvalues and spectral graph theory in understanding graph properties.

Uploaded by

Peter Man
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

Announcement: Class on Friday, September 1 is not going to meet.

Office hours: Tuesday and Thursday from 1:00-2:30 in the Math


Learning Center.

Definition (Bondy and Murty Disconnected). A graph is


disconnected if and only if there exists a partition 𝑉 = [𝑋, 𝑌] of
nonempty sets such that no edge joins a vertex in 𝑋 to a vertex in
𝑌.
One can show that this is equivalent to our working definition of
(dis)connected that involves walks.
This definition can be of help when tackling the question asking you
𝑛−1
to show that if 𝑚 > ( ) then 𝐺 is connected. Think about the
2
cardinalities of 𝑋 and 𝑌, and the number of edges possible in each
of the two sets 𝑋,𝑌.
Incidence matrix 𝑀.
2, if vertex 𝑖 has edge 𝑗 as a loop.
𝑀𝑖𝑗 = { 1, if vertex 𝑖 is incident to edge 𝑗 (not a loop)
0, otherwise
Alternatively, 𝑀𝑖𝑗 is the number of times vertex 𝑖 is an endpoint of
edge 𝑗.

Adjacency matrix 𝐴.
This is a square 𝑛 × 𝑛 matrix whose rows and columns are indexed
on the vertices (presented in the same order).
The entry 𝐴𝑢𝑣 is the number of edges joining 𝑢 and 𝑣 counting
loops twice.
The column sum of the column corresponding to vertex 𝑣 is
deg(𝑣). Similarly for the row sum.
For undirected graphs, 𝐴 is symmetric and the diagonal entries
must be even (loops which count double). For simple graphs, the
entries must be from {0,1}.
Symmetric matrices have “interesting” eigenvalues (which will help
with the homework question.) Also, their characteristic
polynomials have “interesting” properties. Useful for the 500-level
question in the homework that talks about these things.
Example: 𝐺 = 𝑄3 , the three-cube:
For instance, a 3-cube is 3-regular. Indexing its vertices as binary
representations of numbers 0 through 7, two vertices are adjacent if and
only if their rep’ns differ in exactly one position.

110 111

010 011

000 001

100 101

Its adjacency matrix is

0 1 1 0 1 0 0 0
1 0 0 1 0 1 0 0
1 0 0 1 0 0 1 0
0 1 1 0 0 0 0 1
𝐴=
1 0 0 0 0 1 1 0
0 1 0 0 1 0 0 1
0 0 1 0 1 0 0 1
[0 0 0 1 0 1 1 0]
Complete graphs and their adjacency matrices.
The 𝑛 × 𝑛 matrix 𝐽 of all ones:
1 1 1 ⋯ 1
1 1 1 ⋯ 1
𝐽= 1 1 1 ⋯ 1
⋮ ⋮ ⋮ ⋱ ⋮
[1 1 1 ⋯ 1]
Notice that the adjacency matrix of a complete graph on 𝑛 vertices
takes the form 𝐽 − 𝐼 where 𝐼 is the 𝑛 × 𝑛 identity matrix.
Notice that if 𝑤 is the all-ones vector 𝐰 = [1,1,1, … ,1]𝑇 then
𝐽𝐰 = 𝑛𝐰
and so 𝐰 is an eigenvector of 𝐽 with eigenvalue 𝜆 = 𝑛.
Notice also that
(𝐽 − 𝐼 )𝐰 = 𝐽𝐰 − 𝐼𝐰 = 𝑛𝐰 − 𝐰 = (𝑛 − 1)𝐰
There is an entire subdiscipline of graph theory, “spectral graph
theory” that discusses eigenstructures of adjacency matrices
(among others) of graphs.
1
𝑎

𝑒 𝑏 5 2

𝑑 𝑐 4 3

“Equal” or “Identical” graphs have the same vertex and edge sets.
The diagram above depicts two graphs that have the same
structure, even though their vertex sets are different. The graphs
above are said to be “isomorphic.” Two (simple) graphs are
isomorphic if there exists a bijection 𝜃 between the vertex sets that
preserves adjacencies.

You might also like