期刊文献+

强乘积图的限制边连通度

The Restricted Edge-Connectivity of Strong Product Graphs
在线阅读 下载PDF
导出
摘要 文章研究了两连通图G1和G2的强乘积图G1G2的限制边连通度,给出了强乘积图的限制边连通度的一个上界,并确定一类特殊强乘积图的限制边连通度. In this paper,the strong product graph G1G2 of two connected graphs G1 and G2 is considered.An upper bound on the strong product graphs G1G2 of two connected graphs G1 and G2 is given,and the restricted edge-connectivity of a class of the strong product graphs is determined.
作者 李洋 王世英
出处 《太原师范学院学报(自然科学版)》 2010年第3期30-32,48,共4页 Journal of Taiyuan Normal University:Natural Science Edition
关键词 强乘积图 限制边连通度 边连通度 strong product graphs restricted edge-connectivity edge-connectivity
  • 相关文献

参考文献2

二级参考文献6

  • 1孙犁,徐俊明.强乘积图的连通度(英文)[J].中国科学技术大学学报,2006,36(3):241-243. 被引量:4
  • 2Bermond J C,Germa A,Heydemann M C.Hamiltonian cycles in strong products of graphs[J].Can.Math.Bull.,1979,22:305-309.
  • 3Godsil C,Royle G.Algebraic Graph Theory[M].New York:Springer,2001,155-156.
  • 4Král D,MaxováJ,Podbrdsky P,et al.Pancyclicityof strong products of graphs[J].Graphs and Combinatorics,2004,20 (1):91-104.
  • 5XU Jun-ming.Topological Structure and Analysis of Interconnection Networks[M].Dordrecht/ Boston/London:Kluwer Academic Publishers,2001.
  • 6XU Jun-ming.Theory and Application of Graphs[M].Dordrecht/Boston/London:Kluwer Academic Publishers,2003.

共引文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部