期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一类3度正则有向图网络模型 被引量：1

A Kind of 3-regular Digraph Network Model
下载PDF
导出
摘要 讨论了一种3度正则网络,这类网络具有较小的网络直径,本文给出了网络直径、网络支撑树和欧拉环游的数目的公式。 A kind of 3-regular digraphy network model is discussed in this paper, the diameter of this model is shorter than others. The diameter, the number of Eulerian tours and spanning trees of this type of networks are deduced.
作者 孙力
机构地区 漳州师院计算机系
出处 《数学研究》 CSCD 2003年第3期297-300,共4页 Journal of Mathematical Study
基金 漳州师院自然科学基金(SK02014)
关键词 网络直径 支撑树 欧拉环游 正则有向图 迭线图 互联网 network diameter spanning tree Eulerian tours
分类号 O157.5 [理学—基础数学] TP393.01 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献9

  • 1杜妮,肖文俊.C(n,k):一类新的3度正则网络模型[J].计算机科学,2002,29(z1):10-11. 被引量：1
  • 2Beineke L W. Selected Topics in Graph Theory. Academic Press, London, 1978.
  • 3Fiol Met al. A discrete optimization problem in local networks and data alignment, IEEE Trans. Comput. 1987, C-38, 702-713.
  • 4Fiol Mct al. Line digraph iteration and the (d, K) digraph problem, IEEE Trans. Comput. 1984, C-33,400-403.
  • 5Bermond J C et al.. Graph and interconnection networks: diameter and vulnerability, in: Surveys in Combinatories, London Math. Soc. Lecture Note Ser , Vol 28 (Cambridge Univ. Press, Cambridge,1983).
  • 6Bermond J C. et al.. Large fault tolerant interconnection networks, Proceedings of the 1st Japan international conference on Graph Theory and Applications, Nakrone) Japan (1986); Graph Combin. 1989, 5: 107-123.
  • 7Imase M, Ioth M. Design to minimize diameter on building-block networks, IEEE Trans. Compat, 1983,C-30, 782-784.
  • 8Huaxiao Zhang, Fuji Zhang, Qiongxiang Huang. On the number of spanning trees and Edlerian tours in iterated line digraphs. Discrete Applied Mathematics 1997, 73:59-67.
  • 9Sedlacek J (1970). on the skeletons of graph or digraph, Combinatorial structures and Applications ((Gotdon and Breach, New York), 387-391.

二级参考文献6

  • 1[1]Akers S B, Krishnamurthy B. A group theoretic model for symmetric interconnection networks [J]. IEEE Trans. Comput. ,1989,38: 555～565
  • 2[2]Leighton F T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes [M]. San Mateo, Calif:Morgan Kaufmann Publishers,1992
  • 3[3]Espona M, Serra O. Cayley digraphs based on the de Bruijn networks[J]. SIAM. J. Discrete Math. ,1998,11(2):305～317
  • 4[4]Preparata F,Vuillemin J. The Cube-Connected Cycles: Versatile Network for Parallel Computation [J]. Comm. ACM, 1981,24:30～39
  • 5[5]Beineke L W, Wilson R J. Selected Topics in Graph Theory I [M]. London, New York,San Francisco: Academic Press Inc. ,1978. 293～302
  • 6[6]Shibata Y, Hasunuma T, Fukuda S. Isomorphic factorization of de Bruijn digraphs[J]. Discrete Mathematics, 2000(218) : 199～208

同被引文献7

  • 1张若英,邱雪松,孟洛明.电信网络管理质量的分层评价模型[J].邮电设计技术,2004(7):27-31. 被引量：1
  • 2H. Nagamochi, T. Ibaraki. Computing edge-connectivity in rnultigraphs and eapaeitated graphs[J]. SIAM J. Discrete Math, 1992 : 54-66.
  • 3Dingjun Lou, Wei Wang. An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs [J]. Ars Comb, 2005,77:311-318.
  • 4B. Peroche. On several sorts of connectivity[J].Discrete Math. 1983, 46:267-277.
  • 5J. A. Bondy, U. S. R. Murty. Graph theory with applications[M]. Macmillan Press, London, 1976.
  • 6Zdenk Dvodk, Jan Kdra, Daniel Krdl, et al. An Algorithm for Cyclic Edge Connectivity of Cubic Graphs [J]. LNCS, 2004,3111:236-247.
  • 7曹阳,陶舒,吴逵.基于模拟技术与测量技术的网络性能评测方法[J].计算机学报,1999,22(5):508-512. 被引量：6

引证文献1

数学研究
2003年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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