跳到主要内容

東京大学 新領域創成科学研究科 メディカル情報生命専攻 2017年8月実施 問題10

Author​

zephyr

Description​

Answer the following questions regarding graphs.

(1) Prove that the sum of the vertex degrees of an undirected graph is equal to the number of edges times two.

(2) Prove the following proposition: If a graph with vertex set and edge set is a tree, .

(3) Given an undirected graph and a set of edges , the graph is called a spanning tree, if is a tree. Among all spanning trees of a weighted graph, those with the minimum sum of weights are called minimum spanning trees. Show a minimum spanning tree of the following graph.

(4) Assume that and are different spanning trees of graph . Prove the following proposition: For any edge , there is an edge such that forms a spanning tree.

回答以下关于图的问题。

(1) 证明无向图的顶点度数之和等于边数的两倍。

(2) 证明以下命题：如果图 的顶点集 和边集 是一棵树，那么 。

(3) 给定一个无向图 和一组边 ，如果 是一棵树，则图 称为生成树。在所有加权图的生成树中，权重和最小的称为最小生成树。展示下图的最小生成树。

(4) 假设图 的生成树 和 不同。证明以下命题：对于 中的任何边 ，存在 中的边 使得 形成一棵生成树。

Kai​

(1)​

In an undirected graph , each edge connects two vertices, contributing to the degree of both vertices. Therefore, each edge increases the sum of the vertex degrees by 2. Mathematically,

where denotes the degree of vertex , and denotes the number of edges. This is known as the Handshaking Lemma.

(2)​

A tree is a connected acyclic graph. For a graph to be a tree, it must satisfy the following properties:

  1. It is connected.
  2. It contains no cycles.
  3. The number of edges .

To prove this, we use induction on the number of vertices .

Base Case: For , there are no edges, so .

Inductive Step: Assume the statement is true for a tree with vertices, i.e., it has edges. Consider adding a new vertex to the tree. To maintain the tree properties, must be connected to exactly one existing vertex, adding one new edge. Thus, the new tree has vertices and edges, maintaining the property .

Hence, by induction, the proposition is proved.

(3)​

To find the minimum spanning tree, we can use Kruskal's algorithm or Prim's algorithm. Here, we will use Kruskal's algorithm.

  1. Sort the edges by weight:

    • A-C (2)
    • B-D (4)
    • D-E (4)
    • A-B (5)
    • B-C (7)
    • B-E (8)
    • C-E (9)

  2. Select edges in order of weight, ensuring no cycles are formed:

    • A-C (2)
    • B-D (4)
    • D-E (4)
    • A-B (5)

Thus, the minimum spanning tree includes edges A-C, B-D, D-E, and A-B.

(4)​

Given two different spanning trees and of graph , and an edge , consider adding to . This addition creates exactly one cycle, since is initially acyclic.

In this cycle, there must be at least one edge that is in but not in (because if every edge in the cycle were in , would not be in the cycle). Removing this edge from breaks the cycle, restoring the tree property.

Therefore, forms a spanning tree.

Knowledge​

图论 最小生成树 Kruskal算法 数学归纳法

重点词汇​

  • vertex 顶点
  • edge 边
  • degree 度
  • spanning tree 生成树
  • minimum spanning tree 最小生成树
  • cycle 环

参考资料​

  1. "Introduction to Graph Theory" by Douglas B. West, Chapter 1
  2. "Graph Theory with Applications" by Bondy and Murty, Section 2.1