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

图的联结数与分数n-边(点)可消去图
引用本文:周思中.图的联结数与分数n-边(点)可消去图[J].数学的实践与认识,2007,37(7):98-102.
作者姓名:周思中
作者单位:江苏科技大学,数理学院,江苏,镇江,212003
摘    要:讨论了图的联结数bind(G)与分数n-边(点)可消去图之间的关系,给出了一个图是分数n-边(点)可消去图的若干充分条件.

关 键 词:  联结数  分数因子  n-边(点)可消去图
修稿时间:2005年12月19

The Binding Numbers of Graphs and Fractional n-edge (vertex) Deleted Graphs
ZHOU Si-zhong.The Binding Numbers of Graphs and Fractional n-edge (vertex) Deleted Graphs[J].Mathematics in Practice and Theory,2007,37(7):98-102.
Authors:ZHOU Si-zhong
Abstract:This paper discusses the relationship between fractional n-edge(vertex) deleted graphs and the binding numbers of graphs,and some sufficient conditions for graphs to be fractional n-edge(vertex) deleted graphs are given.
Keywords:graph  binding number  fractional factor  n-edge(vertex) deleted graph
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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