4度循环图的不交路及k-宽直径（英文）

刘淑亭; 孟吉翔

您当前的位置：

首页 >

文章列表页 >

4度循环图的不交路及k-宽直径（英文）

更新时间：2026-01-21

- 4度循环图的不交路及k-宽直径（英文）
- Journal of Xinjiang University (Natural Science Edition in Chinese and English) Vol. 31, Issue 4, Pages: 379-382(2014)
- 作者机构：
  
  新疆大学数学与系统科学学院
- 作者简介：
- 基金信息：
- DOI：
  CLC： O157.5
- Published：2014
- 稿件说明：
移动端阅览
[1]刘淑亭,孟吉翔.4度循环图的不交路及k-宽直径（英文）[J].新疆大学学报(自然科学版),2014,31(04):379-382.

刘淑亭, 孟吉翔. 4度循环图的不交路及k-宽直径（英文）[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2014, 31(4): 379-382.
[1]刘淑亭,孟吉翔.4度循环图的不交路及k-宽直径（英文）[J].新疆大学学报(自然科学版),2014,31(04):379-382. DOI：

刘淑亭, 孟吉翔. 4度循环图的不交路及k-宽直径（英文）[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2014, 31(4): 379-382. DOI：

摘要

研究了4度循环图

构造出其任意两点之间的四条内部点不交路

并且给出其宽直径的一个较好的上界.

Abstract

In this paper

we give a family of four internally disjoint paths between any two vertices of the circulant graph with degree 4 by constructing. Moreover

one upper bound of 4-wide diameter of the kind of the circulant graph is also given.

关键词

Keywords

references

Bondy J A,Murty.Graph theory with applications[M].London:The Macmillan Press LTD,1976.

Liaw S C,G J.Rabin number of Butterfly Networks[J].Discrete Math,1999,196(1-3):219-227.

Erik A,Doorn van.Circulants and Their Connectivities[J].Journal of Graph theory,1984,8:487-499.

Watkins M E.Connectivity of Transitive Graphs[J].Combinatorial Theory,1970,8:23-29.

Pang B,Shao H R,Gao W.A Measurement-Based Admission Control Scheme for DiffServ Network:Design and Application[J].Chinese Journal of Computers,2003,26(3):257-265.

Yang Weihua,Meng Jixiang.Generalized measures of fault tolerance in hypercube networks[J].J Applied Mathematics Lett,2012,25:1335-1339.

Zhang Zhao,Meng Ji-xiang.Super Edge Connectivity of Infinite Circulants[J].Mathematic Applicata,2002,15:68-71.

Roertson Neil.Graph Minors.The Disjoint Paths Problem[J].Journal of combinatorial Theory Series B,1995,63:65-110.

Frank Ha D,Tomasz tuczakb.Note On the k-diameter of k-regular k-connected graphs[J].Discrete Mathematics,1994,133:291-296.

Robin S,Sanders.Products of Circulant Graphs Are Metacirculant[J].Journal of Combinatorial Theory Series B,2002,85:197-206.

Joseph J.Rotman.Advanced Modern Algebra(First edition)[M].Prentice Hall,2002.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰