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

 按 中文标题 英文标题 中文关键词 英文关键词 中文摘要 英文摘要 作者中文名 作者英文名 单位中文名 单位英文名 基金中文名 基金英文名 杂志中文名 杂志英文名 栏目英文名 栏目英文名 DOI 责任编辑 分类号 杂志ISSN号 检索 检索词:

 收费全文 5篇 国内免费 3篇
 数学 8篇
 2013年 1篇 2011年 1篇 2003年 2篇 2002年 2篇 2001年 1篇 1999年 1篇

1
1.
4连通图的可去边与4连通图的构造   总被引：2，自引：0，他引：2

2.

3.

G是3-连通图，e是G中的一条边．若G-e是3-连通图的一个剖分，则称e是3-连通图的可去边．否则，e是G中不可去边．本给出3-连通3-正则图中生成树外可去边的分布情况及数目．  相似文献
4.

5.

6.

7.
An edge e of a k-connected graph G is said to be a removable edge if G O e is still k-connected, where G O e denotes the graph obtained from G by the following way： deleting e to get G - e, and for any end vertex of e with degree k - 1 in G - e, say x, deleting x, and then adding edges between any pair of non-adjacent vertices in NG-e （x）. The existence of removable edges of k-connected graphs and some properties of k-connected graphs have been investigated. In the present paper, we investigate the distribution of removable edges on a spanning tree of a k-connected graph （k ≥ 4）.  相似文献
8.
An edge e of a k-connected graph G is said to be a removable edge if Ge is still k-connected, where Ge denotes the graph obtained from G by deleting e to get Ge, and for any end vertex of e with degree k − 1 in Ge, say x, delete x, and then add edges between any pair of non-adjacent vertices in N Ge (x). The existence of removable edges of k-connected graphs and some properties of 3-connected graphs and 4-connected graphs have been investigated. In the present paper, we investigate some properties of k-connected graphs and study the distribution of removable edges on a cycle in a k-connected graph (k ≥ 4).  相似文献
1