| 关于Menger图的几种运算 |
| |
| 作者姓名： | Vumar E Maham A |
| |
| 作者单位： | 新疆大学数学系 |
| |
| 摘 要： | 设Ｇ是一个简单连通图，若分离Ｇ的余一独立集Ｓ的最小点数等于连接Ｓ的点之间的内部不相交路的最大个数，则称Ｇ是Ｍｅｎｇｅｒ图。我们考虑了图的几种运算并给出了运算后的图是Ｍｅｎｇｅｒ图的条件。
|
| 关 键 词： | 图 独立集 Menger定理 |
Some Operations on Menger's Graphs |
| |
| Vumar,E Maham,A.Some Operations on Menger''s Graphs[J].Journal of Xinjiang University(Science & Engineering),1996,13(1):18-20. |
| |
| 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 维普 等数据库收录！ |
