期刊文献+

无向超环面网的距离参数(英文)

Parameters on distance of undirected toroidal mesh
下载PDF
导出
摘要 平均距离μ(G),距离控制数γl(G)和距离独立数αd(G)是度量网络性能的重要参数.n维无向超环面网是超立方体的推广.证明了μ(G)=1/d1d2…dn-1n∑i=1(ei2+ei+ei'2-ei'/2·d1d2…dn/di),γ(G)=2当且仅当[e1'+e2'…+en'/2]≤l≤d(G)-1(d1≥d2≥…dn≥4),以及αd(G)=2当[d1+d2+…+dn-2/3]≤d≤d(G)-1(d1≥d2≥…dn≥3). The average distance μ(G),distance l-domination number γl(G) and distance d-independence number αd(G) are important parameters to measure the performance of a network.The n-dimensional undirected toroidal mesh C(d1,d2,…,dn) is considered as a generalization of hypercube.It was proved that μ(C(d1,d2,…,dn))=1/d1d2…dn-1n∑i=1(ei2+ei+ei'2-ei'/2·d1d2…dn/di),γ(C(d1,d2,…,dn))=2 if and only if[e1'+e2'…+en'/2]≤l≤d(G)-1 for d1≥d2≥…dn≥4,and αd(G)=2 for [d1+d2+…+dn-2/3]≤d≤d(G)-1(d1≥d2≥…dn≥3.
作者 谢歆
机构地区 黄山学院数学系
出处 《中国科学技术大学学报》 CAS CSCD 北大核心 2012年第3期173-178,共6页 JUSTC
基金 Supported by Foundation of Huangshan University(2011xkj012)
关键词 平均距离 距离控制数 距离独立数 无向超环面网 average distance distance domination number distance independence number undirected toroidal mesh
  • 相关文献

参考文献3

二级参考文献17

  • 1韩国文,张忠良.关于(k—1)容错直径或k直径的最大图[J].中国科学技术大学学报,1995,25(3):324-329. 被引量:2
  • 2Bondy J A, Murty U S R. Graph Theory with Applications[M]. New York: North Holland, 1976.
  • 3Fischermann M, Volkmann L. Graphs having distance-n domination number half their orer [J]. Discrete Applied Math.,2002,120: 97-107.
  • 4Li H,Xu J M. (d,m)-dominating numbers of m-connected graphs [J]. Rapports de Recherche, LRI, Universite de paris-Sud, 1997,1130.
  • 5Meir A, Moon J W. Relation between packing and covering number of a tree [J]. Pacific Journal of Mathematics, 1975,61(1) : 225-233.
  • 6Slater P J. R-dominations in graphs [J]. J Assoc Comput. Macg., 1976,23 : 446-460.
  • 7Sridharan N , Subramanian V S A, Elias M D. Bounds on the distance two-domination number of a graph [J]. Graphs and Combinatorics, 2002, 18: 667-675.
  • 8Topp J, Vestergaard P D. αk- and γk-stable graphs [J]. Discrete Math , 2000,212:149-160.
  • 9Xu J M. Theory and Application of Graphs [M]. Boston: Kluwer Academic Publishers, 2003.
  • 10A.E.Barkuskas,L.H.Host,Finding efficient dominating sets in oriented graphs,Congr,Numer.,98 (1993),27-32.

共引文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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