期刊文献+

超立方体网络的距离参数 被引量:1

Parameters on Distance of Hypercube
下载PDF
导出
摘要 平均距离、距离独立数和距离控制数都是度量网络性能的重要参数。在某种程度上,平均距离比直径更能衡量网络的性能。确定一般图的距离独立数和距离控制数是NPC问题,对于给定的正整数d和l,确定特殊图类的距离独立数和距离控制数显得很重要。得到超立方体网络的平均距离,以及对于某些正整数d和l,超立方体网络的距离独立数和距离控制数。 The average distance,distance domination number and distance independence number areall important parameters to measure the performance of a network.In some sense,the average distance canmore precisely measure the performance of a network than the diameter.It is well known that todetermine distance domination number and distance independence number are NPC problems,so it is veryimportant to determine distance domination number and distance independence number of some specialgraphs for given integers d and l.This paper obtains the average distance of hypercubic network,and itsdistance domination number and distance independence number for some integers d and 1.
作者 谢歆
机构地区 黄山学院数学系
出处 《黄山学院学报》 2010年第5期1-3,共3页 Journal of Huangshan University
关键词 平均距离 距离独立数 距离控制数 超立方体网络 average distance distance domination number distance independence number hypercubicnetwork
  • 相关文献

参考文献5

  • 1Bondy J A, Murty U S R. Graph theory with applications [M].Ameriean Elsevier Publishing Co. Inc. New York, 1976.
  • 2徐俊明.互连网络拓扑结构分析[M].合肥:中国科学技术大学研究生教材,2002:108.
  • 3田方,徐俊明.广义de Bruijn和Kautz有向图的距离控制数(英文)[J].运筹学学报,2006,10(1):88-94. 被引量:6
  • 4Dankelmann P. Average distance and domination numbers [J]. Discrete Application Mathematics, 1997, 80: 21-35.
  • 5Tian Fang, Xu Jun-ming. Average distance and distance domination numbers [J]. Discrete Applied Mathematics, 2009,157(5):1113-1127.

二级参考文献8

  • 1A.E.Barkuskas,L.H.Host,Finding efficient dominating sets in oriented graphs,Congr,Numer.,98 (1993),27-32.
  • 2J.A.Bondy and U.S.R.Murty,Graph Theory with Applications.New York:North Holland,1976.
  • 3M.Fischermann and L.Volkmann,Graphs having distance-n domination number half their order.Discrete Applied Math.,120 (2002),97-107.
  • 4J.Ghoshal,R.Laskar,D.Pillone,Topics on domination in directed graphs,in Domination in Graphs (eds.T.W.Haynes,S.T.Hedetniemi,P.J.Slater),Marcel Dekker,New York,(1998),pp.401-437.
  • 5Y.Kikuchi and Y.Shibata,On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs.Inform.process.Lett.,86 (2003) 79-85.
  • 6A.Meir and and J.W.Moon,Relation between packing and covering number of a tree.Pacific Journal of Mathematics,61(1) (1975),225-233.
  • 7P.J.Slater,R-dominations in graphs.J.Assoc.Comput.Macg.,23 (1976),446-460.
  • 8N.Sridharan,V.S.A.Subramanian and M.D.Elias,Bounds on the Distance Two-Domination Number of a Graph.Graphs and Combinatorics.,18 (2002),667-675.

共引文献5

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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