首页 | 本学科首页   官方微博 | 高级检索  
     检索      

图的字典积的整数流
引用本文:郑艺容,侯远.图的字典积的整数流[J].福州大学学报(自然科学版),2006,34(4):461-463.
作者姓名:郑艺容  侯远
作者单位:1. 厦门理工学院数理系,福建,厦门,361005
2. 福州大学至诚学院,福建,福州,350002
摘    要:得到对连通图G1和阶数大于3的图G2,他们的字典积G1G2]有非零4-流.特别当G2是二部图时,G1G2]有非零3-流.通过一个完全不同的方法,也得到了如果G1有非零3-流且具有完美匹配或G2有非零3-流,那么G1G2]有非零3-流.

关 键 词:  非零整数流  字典积
文章编号:1000-2243(2006)04-0461-03
修稿时间:2005年8月31日

Flows on lexicographic product of graphs
ZHENG Yi-rong,HOU Yuan.Flows on lexicographic product of graphs[J].Journal of Fuzhou University(Natural Science Edition),2006,34(4):461-463.
Authors:ZHENG Yi-rong  HOU Yuan
Institution:1.Department of Mathematics and Physics,Xiamen College of Technology,Xiamen,Fujian 361005,China;2.Zhicheng College,Fuzhou University,Fuzhou,Fujian 350002,China)
Abstract:It is shown that for a nontrivial connected graph G_1 and a connected graph G_2 of order at least 3,the lexicographic product G_1 of G_1 and G_2 admits a nowhere-zero 4-flow in general. Furthermore if G_2 is bipartite,then the product admits a nowhere-zero 3-flow.By a different method we also show that if G_1 admits a nowhere-zero 3-flow and has perfect matchings or G_2 admits a nowhere-zero 3-flow,then the product admits a nowhere-zero 3-flow.
Keywords:graph  nowhere-zero flow  lexicographic product
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《福州大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《福州大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号