您的位置:首页  > 论文页面

图上字典序积的非零3-流问题

发表时间:2010-01-15  浏览量:1551  下载量:553
全部作者: 舒驰,徐永
作者单位: 华中师范大学数学与统计学学院;武汉理工大学计算机学院
摘 要: 研究了2个图的字典序积允许3-流的情况,即2个非平凡图的字典序积一定允许3-流通过。首先将图进行分解,分解后的图就是一些路和圈,路和路的字典序积、路和圈的字典序积、圈和圈的字典序积都是Z3-联通的,并且将它们粘起来还是Z3-联通的。给出的结论较有意义,解决了除图的笛卡儿积和张量积后的又一个2个图的积的问题。
关 键 词: 图论;非零整数流;字典序积;Z3-联通
Title: Nowhere-zero 3-flows in lexicographic products of graphs
Author: SHU Chi, XU Yong
Organization: Department of Math and Statistics, HuaZhong Normal University;College of Computer Science and Technology, Wuhan University of Technology
Abstract: This paper looked at the lexicographic product of two nontrivial graphs admits a nowhere-zero 3-flow. First of all, it decomposed the graph, the graph which was decomposed is some paths and cycles, and the lexicographic products of path and path, path and cycle, cycle and cycle are Z3-connected. Then it is still Z3-connected when stick these graphs up. The main result can be observed. In graph theory, there are a wide range of research in the 3-flow problem, so this study is very significant. It resolves another 3-flow problem of products in graphs, in addition to the Cartesian product and the tensor product of two graphs.
Key words: graph theory; nowhere-zero flow; lexicographic product; Z3-connected
发表期数: 2010年1月第1期
引用格式: 舒驰,徐永. 图上字典序积的非零3-流问题[J]. 中国科技论文在线精品论文,2010,3(1):92-95.
 
0 评论数 0
暂无评论
友情链接