| 定向可图的度偶序列 |
| |
| 引用本文： | 李炯生,杨凯.定向可图的度偶序列[J].数学研究,2002,35(2):140-146. |
| |
| 作者姓名： | 李炯生 杨凯 |
| |
| 作者单位： | 中国科学技术大学数学系,安徽,合肥,230026 |
| |
| 基金项目： | Project supported by the National Natural Secience Foundatons of China(Grant No.
199710 86 ) and the Doctoral Program Foundation of National Education Department of
China |
| |
| 摘 要： | n为非负整数序列，若存在以该序列为度序列的图，则称n为可图的，特别的，若此图是一个定向图，该序列则称为是定向可图的，本提出了一个判断序列是否为定向可图的充分必要条件，并且在定理的证明过程中给出了一个在定理条件下构造所求定向图的有效算法。
|
| 关 键 词： | 定向可图 度（偶）序列 定向图 |
Degree Sequence of Oriented Graphs |
| |
| Li Jiongsheng,Yang Kai.Degree Sequence of Oriented Graphs[J].Journal of Mathematical Study,2002,35(2):140-146. |
| |
| Authors: | Li Jiongsheng Yang Kai |
| |
| Abstract: | A sequence π of nonnegative integers is said to be graphic if there is a graph whose degree sequence is π. Especially, if such graph is an oriented graph, the sequence is said to be oriented graphic. In this paper, we provide a sufficient and necessary condition to judge whether a sequence is oriented graphic. Furthermore, in the proof of the theorem, an algorithm is provided to construct the oriented graph with the given degree sequence when a certain pair of adjacency matrices has been found. |
| |
| Keywords: | graph realization degree sequence oriented graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
