关于Menger图的几种运算 |
| |
引用本文: | Vumar,E Maham,A. 关于Menger图的几种运算[J]. 新疆大学学报(理工版), 1996, 13(1): 18-20 |
| |
作者姓名: | Vumar E Maham A |
| |
作者单位: | 新疆大学数学系 |
| |
摘 要: | 设G是一个简单连通图,若分离G的余一独立集S的最小点数等于连接S的点之间的内部不相交路的最大个数,则称G是Menger图。我们考虑了图的几种运算并给出了运算后的图是Menger图的条件。
|
关 键 词: | 图 独立集 Menger定理 |
Some Operations on Menger''s Graphs |
| |
Abstract: | Let G be a simple connected graph. If the minimum number of points separating any independent set S of points in G is the maximum number of disjoint paths between the points of S. then G is called a Monger's graph. We consider some composition graphs and give conditions for them to be Menger's graphs. |
| |
Keywords: | Grapes independent set Manger's Theorem |
本文献已被 CNKI 维普 等数据库收录! |