| 图的笛卡儿积及字典式积的连通性 |
| |
| 引用本文： | 靳艳军,孟吉翔.图的笛卡儿积及字典式积的连通性[J].运筹学学报,2007,11(4):59-64,126. |
| |
| 作者姓名： | 靳艳军 孟吉翔 |
| |
| 作者单位： | 新疆大学数学与系统科学学院,乌鲁木齐,830046 |
| |
| 基金项目： | The research is supported by NSFC, FUKT and TRAPOYT |
| |
| 摘 要： | 文章给出了两个图的笛卡儿积及字典式的积为最大边连通的、最大连通的、super-λ,super-κ及hyper-κ的充分条件,同时证明了其中一些条件也是必要的.此外,对这两种积的局部割集和广义割集的性质也进行了考虑.
|
| 关 键 词： | 运筹学 笛卡儿积 字典式积 上连通 超连通 广义割集 局部割集 |
| 收稿时间： | 2006-09-07 |
| 修稿时间： | 2006年9月7日 |
Connectivity of the Cartesian Product and the Lexicographic Product of Graphs |
| |
| Jin Yanjun,Meng Jixiang.Connectivity of the Cartesian Product and the Lexicographic Product of Graphs[J].OR Transactions,2007,11(4):59-64,126. |
| |
| Authors: | Jin Yanjun Meng Jixiang |
| |
| Abstract: | In this paper, sufficient conditions for the Cartesian product of two graphs or the lexicographic product of two graphs to be maximum edge-connected, maximum connected, super edge-connected, super connected or hyper connected are presented. Some conditions are shown to be also necessary. In addition, properties on local cuts and generalized cuts in these two kinds of product of graphs are also considered. |
| |
| Keywords: | Operations research cartesian product lexicographic product superconnected hyper-connected generalized cut local cut |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
