forked from PKUanonym/REKCARC-TSC-UHT
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
24 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,24 @@ | ||
一、给一个有向图,有自环,分别求v1到v4有2、3、4条边的道路的个数。 | ||
|
||
二、已知G不连通,求证:G的补图连通。 | ||
|
||
三、简单连通图G的任一条边都在某生成树中。 | ||
|
||
四、图G有n-1条边。证明:任意两点之间存在唯一道路。 | ||
|
||
五、给定一个有向连通图,每个点代表一个城市,有两个入度为0点和两个出度为0的点。前两个点发生疫情,需要阻断某些道路使得疫情不会顺着道路传到后两个点。给出阻断每条道路的代价,求满足防控要求的阻断道路方案的最小代价以及相应的被阻断道路的集合。 | ||
|
||
六、青蛙🐸社团开展某个脱单联谊活动。共4名男生(A、B、C、D)和4名女生(a、b、c、d)参与。一名男生与一名女生配对。 | ||
|
||
(1)给出每名男生和每名女生配对的权值(权值的意义忘记了……),求配对后最大的权值。 | ||
|
||
(2)给出“稳定匹配”的概念,即每名男生存在与每名女生配对的偏好,女生亦存在这种配对的偏好。所有的偏好均给出。给出“稳定匹配”的GS算法的描述,求最终匹配状态。 | ||
|
||
七、群G。a为G中一固定元素。f: G→G。f_a(x) = axa^(-1)。求证:f_a为同构。 | ||
|
||
八、A、B均为群G的子群。A∪B=G。求证:A=G或B=G。 | ||
|
||
九、H为群G的子群。求证:H左陪集中的元素的逆元构成右陪集。 | ||
|
||
十、除了群论、图论之外,课堂上印象最深的一句话。 | ||
|