Scribd
Upload
21 views5 pages

Graph Theory Session 3

Uploaded by

usasua1112
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
21 views5 pages

Graph Theory Session 3

Uploaded by

usasua1112
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
You are on page 1/ 5

GIST, 2024-Fall Graph Theory

Session 3: Tree
Hisu Kim

October 18, 2024

1 What is “tree”?
1.1 Let’s start from definition.
Definition 1. Tree vs Forest

A Tree is a connected acyclic graph.

A Forest is an acyclic graph.

A spanning subgraph of G is a subgraph with vertex set V (G).

A spanning tree is a spanning subgraph that is a tree.

1.2 They are all equivalent!


Theorem 1. For an n-vertex graph G (with n ≥ 1), the following are equivalent ( and characterize the trees with n
vertices.
1. G is connected and has no cycles.
2. G is connected and has n − 1 edges.

3. G has n − 1 edges and no cycles.


4. u, v ∈ V (G), G has exactly one u, v-path.
Corollary 1. From Theorem 1,

1. Every edge of a tree is a cut-edge1 .


2. Adding one edge to a tree forms exactly one cycle.
3. Every connected graph contains a spanning tree.

1.3 Simple but tricky

1. A connected forest is . 6. How many spanning trees does a tree have?

2. Every component of a forest is . 7. How many spanning trees does a forest have?

3. Are trees always bipartite? 8. A connected subgraph of G is a spanning subgraph.


(T/F)
4. Are forests always bipartite?
9. A spanning subgraph of G is a connected subgraph.
5. If ∆(G) = 2 when G is a tree, G is . (T/F)

1A cut-edge of a graph is an edge whose deletion increases the number of components.

1
GIST, 2024-Fall Graph Theory

2 Review
1. (Quiz#2) Let Gn be the graph whose vertices are the permutations of {1, 2, · · · , n}, with two permutations
a1 , a2 , · · · , an and b1 , b2 , · · · , bn adjacent if they differ by switching two entries. Draw G3 and G4 . For which
n ≥ 3 is Gn bipartite?

2. (Exercises 1.2.17.) Let Gn be the graph whose vertices are the permutations of {1, . . . n}, with two permu-
tations a1 , . . . , an and b1 , . . . , bn adjacent if they differ by interchanging a pair of adjacent entries. Prove that
Gn is connected.

3. (Proposition 2.1.8.) If T is a tree with k edges and G is a simple graph with δ(G) ≥ k, then T is a subgraph
of G.

4. (HW#3) How many simple graphs on n vertices with vertex degrees all even?

2
GIST, 2024-Fall Graph Theory

3 Exercise
1. Find all minimum spanning trees using 1) Prim’s algorithm and 2) Kruskal’s algorithm.

F Edge Cost
1 3 AB 4
AC 1
B G
3 AD 2
3 BC 4
4 1 3 BD 1
2 D BE 3
A 4 2 E BF 1
CD 3
3 CE 2
1 2 DE 2
DF 3
C EG 3
FG 3

3
GIST, 2024-Fall Graph Theory

2. Is this example an MST? By applying either Prim’s or Kruskal’s, can you find an MST including the edge
u0 u1 ?

4
GIST, 2024-Fall Graph Theory

4 (Teaser) α β α′ β′

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy