| 混合Euler图的特征性质 |
| |
| 引用本文： | 杨曜錩. 混合Euler图的特征性质[J]. 上海师范大学学报(自然科学版), 1989, 0(3) |
| |
| 作者姓名： | 杨曜錩 |
| |
| 作者单位： | 华东师范大学数学系 |
| |
| 摘 要： | 本文对任意混合图 M 建立相伴运输网络 N_M 的概念,并以此给出 M 是混合 Euler 图的充要条件。这结果与文献中同类结果相比,具有更大的实用性。
|
| 关 键 词： | 混合图 混合 Euler 图 顶点的度 裂开 相伴运输网络 |
Characterizations of Mixed Eulerian Graphs |
| |
| YANG YAOCHANG. Characterizations of Mixed Eulerian Graphs[J]. Journal of Shanghai Normal University(Natural Sciences), 1989, 0(3) |
| |
| Authors: | YANG YAOCHANG |
| |
| Affiliation: | Department of Mathematics |
| |
| Abstract: | The conceyt of the associated transportation network N_M for any mixed graph M is introduced.A necessary and sufficient condition is also given to determine whether M is a mixed Eulerian grayh.The result has more practicability when compared with the similar results in related references. |
| |
| Keywords: | mixed graph mixed Eulerian graph degree of a vertex splitting away associated transportation network |
| 本文献已被 CNKI 等数据库收录！ |
