東京大学 新領域創成科学研究科 メディカル情報生命専攻 2015年8月実施 問題10
Author
Description
In a directed graph, a path is a series of one or more arcs that connect a series of vertices. A cycle is a path that starts and ends on the same vertex. An Eulerian path (cycle, respectively) is a path (cycle) that visits every arc exactly once.
Next, we create a directed graph from string
(1) When
(2) When
(3) A vertex is balanced if the number of arcs entering the vertex is equal to the number of arcs leaving the vertex. A directed graph is balanced if every vertex is balanced. A directed graph is connected if it has a path from any vertex to any vertex. Prove that a directed graph with an Eulerian cycle is connected and balanced.
(4) Conversely, if a graph is connected and balanced, prove that the graph has an Eulerian cycle.
在有向图中,一条路径是连接一系列顶点的一条或多条弧。一个环是起点和终点在同一个顶点的路径。欧拉路径(或环)是一条恰好遍历每条弧一次的路径(或环)。
接下来,我们从字符串
(1) 当
(2) 当
(3) 如果一个顶点的进入弧的数量等于离开弧的数量,则该顶点是平衡的。如果每个顶点都是平衡的,则有向图是平衡的。如果有向图从任意顶点到任意顶点都有路径,则它是连通的。证明一个有欧拉环的有向图是连通且平衡的。
(4) 反之,如果一个图是连通且平衡的,证明该图有一个欧拉环。
Kai
(1)
Given
Vertex set:
Labeled arc set:
To find all Eulerian paths and cycles, we need to traverse all arcs exactly once.
Eulerian paths:
There are no Eulerian cycles in
(2)
For
Vertex set:
Labeled arc set:
Eulerian cycle (also as Eulerian path):
For
Vertex set:
Labeled arc set:
Eulerian path:
There are no Eulerian cycles in
(3)
Let
Note: We assume that
Connectedness
Suppose
Balance
Let
(4)
Let
- Start at any vertex
. - Choose any outgoing arc and follow it to the next vertex.
- Continue this process, each time choosing an unused arc, until we return to
.
This process must terminate because:
a) The graph is balanced, so we can always leave a vertex we've entered (except possibly
b) The number of arcs is finite, so we must eventually return to
Let's call the cycle we've constructed
is balanced: The balance of vertices in is unaffected by removing the equal number of incoming and outgoing arcs in . is connected to : If it weren't, would not be connected.
Choose a vertex
Repeat this process until all arcs are used. The result is an Eulerian cycle in
Knowledge
图论 欧拉路径 有向图 连通性 平衡性
难点思路
- 构建从字符串到有向图的映射关系
- 在给定的图中找出所有的欧拉路径和欧拉回路
- 理解并
- 证明欧拉回路与图的连通性和平衡性之间的关系
解题技巧和信息
- 欧拉路径和欧拉回路的定义:欧拉路径是遍历图中每条边恰好一次的路径,欧拉回路是起点和终点相同的欧拉路径。
- 构建有向图:注意字符串到图的映射关系,特别是顶点和边的定义。
- 寻找欧拉路径和回路:从任意顶点开始,每次选择一条未使用的边,直到无法继续为止。
- 证明技巧:使用反证法和构造法来证明定理。
- 图的性质:理解连通性和平衡性对欧拉回路存在性的影响。
重点词汇
- Eulerian path 欧拉路径
- Eulerian cycle 欧拉回路
- Directed graph 有向图
- Connected graph 连通图
- Balanced graph 平衡图
- Vertex 顶点
- Arc 弧(有向边)
- Cycle 环
参考资料
- Bondy, J.A. and Murty, U.S.R. (2008). Graph Theory. Springer. Chapter 5: Eulerian Graphs.
- Diestel, R. (2017). Graph Theory (5th ed.). Springer. Chapter 1: The Basics.
- Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press. Chapter 22: Elementary Graph Algorithms.