Havel - Hakimi 定理
来源:互联网 发布:淘宝卡通行走人偶 编辑:程序博客网 时间:2024/05/17 07:54
转载自Coddicted
The Havel Hakimi Algorithm
Example 1:
S = 4, 3, 3, 3, 1
Where n = 5 (no. of vertices)
Step 1. Degree of all vertices is less than or equal to n ( no.of vertices)
Step 2. Odd number vertices are four.
Step 3. There is no degree less than zero.
Step 4. Remove ‘4’ from the sequence and subtract 1 from the remaining new sequence and arrange again in non-increasing order to get
S = 2,2,2,0
Step 5. Again remove ‘2 ‘ from the sequence and subtracting 1 from the remaining new sequence and arrange in non-increasing order we get
S= 1,1,0
Repeating the above step
S= 0,0
Step 6. Since all the deg remaining in the sequence is zero, the given sequence is graphical.
Example 2:
Consider the degree sequence: S = 7, 5, 5, 4, 4, 4, 4, 3
Where n = 8 (no. of vertices)
Step 1. Degree of all vertices is less than or equal to n ( no.of vertices)
Step 2. Odd number vertices are four.
Step 3. There is no degree less than zero.
Step 4. Remove ‘7’ from the sequence and subtract 1 from the remaining new sequence and arrange again in non-increasing order to get
S = 4, 4, 3, 3, 3, 3, 2
Step 5. Now remove the first ‘4 ‘ from the sequence and subtract 1 from the remaining new sequence to get:
S = 3, 2, 2, 2, 3, 2
rearrange in non-increasing order to get:
S = 3, 3, 2, 2, 2, 2
Repeating the above step we get following degree sequences:
S = 2, 2, 2, 1, 1
S = 1, 1, 1, 1
S = 1, 1, 0
S = 0, 0
Step 6. Since all the deg remaining in the sequence is zero, the given sequence is graphical (or in other words, it is possible to construct a simple graph from the given degree sequence).
- Havel-Hakimi定理
- Havel-Hakimi定理
- poj1659 Havel-hakimi定理
- Havel-Hakimi定理
- Havel - Hakimi 定理
- Havel-Hakimi定理问题
- Havel-Hakimi定理
- Havel-Hakimi定理
- Havel-Hakimi定理
- Havel-Hakimi定理
- Havel-Hakimi定理
- Havel-Hakimi定理 hdu2454 / poj1695 Havel-Hakimi定理
- 度序列(Havel-Hakimi定理)
- Havel-Hakimi定理及其应用
- POJ 1659(Havel-Hakimi定理)
- poj1659(Havel-Hakimi定理)
- poj 1659 havel-hakimi 定理
- POJ 1659 Havel-Hakimi定理
- CRT堆
- Android Service 的添加流程
- OLTP与OLAP有什么区别
- Intent的FLAG_ACTIVITY_CLEAR_TOP和FLAG_ACTIVITY_REORDER_TO_FRONT
- 黑马程序员——异常
- Havel - Hakimi 定理
- UITableView + 协议执行顺序
- Intent 和 Intent Filter
- Javascript:绑定事件处理处器
- linux下Oracle11g RAC搭建(二)
- msseces.exe频繁出错的原因和解决方法?
- ImageView 例子
- opencv中使用addweighted函数将两幅图像叠加
- 01 - Android开发环境搭建