期刊文献+

对称群上Cayley图的连通性(英文)

Connectivity of Cayley Graphs on Symmetric Groups
下载PDF
导出
摘要 本文研究限制性边连通度的︻′-原子.运用所得结果可以证明Cayley图C(Sn,S)是最优超-λ的,这里Sn是n次对称群,S是若干由奇置换构成的共轭类的并,另外,我们还证明了C(Sn,S)是Vosperian的,除非它是完全二部图. In this paper we study the properties of λ′-atoms on restricted edge connectivity. Results are applied to show that the Cayley graph C(S_n,S), is the symmetric group of degree n and S a union of conjugacy classes of odd permutations, is optimal super-λ. In addition, we show that C(S_n, S) is vosperian unless it is the complete bipartite graph..
作者 孟吉翔
出处 《新疆大学学报(自然科学版)》 CAS 2004年第2期113-119,共7页 Journal of Xinjiang University(Natural Science Edition)
基金 Supported by NSFC, FUKT and TRAPOYT
关键词 限制性边连通度 Vosperian CAYLEY图 对称群 共轭类 Restricted edge connectivity Vosperian Cayley graphs Symmetric group
  • 相关文献

参考文献9

  • 1Y.O.Hamidoune and R.Tindell,Vertex connectivity and super line connectedness[J].SIAM.J.Discr.Math.1990,3:524-530.
  • 2A.Esfahanian and S.Hakimi,On computing a conditional edge connectivity of a graph [J].Info.Process.Lett.,1998,27:195-199.
  • 3Q.Li and Q.L.Li,On the reliability comparison between networks for sufficiently small edge falure probabilities[J].submitted to Discrete App.Math.
  • 4Q.L.Li and Q.Li,Reliability analisis of circulant graphs[J].Networks,1998,31:61-65.
  • 5F.T.Boesch and T.F.Wang,Super line connectivity of circulant graphs[J].SIAM.J.Alg.Dis.Math 1986,1:89-98.
  • 6K.Kalpakis and Y.Yesha,On the besection width of the transposition network[J].Networks,1997,29:69-76.
  • 7R.Tindell,Connectivity of Cayley digraphs,in Combinatorial Network Theory[M].(Ding Z.Du and D.F.Hsu eds).Netherlands:Kluwer Academic Publishers,1996,41-64.
  • 8Y.O.Hamidoune,Subsets with small sums in abelian groups'I:the vosper property[J].Europ.J.Combin 1997,4:541-556.
  • 9J.Wang and M.Y.Xu,Quasi-abelian Cayley graphs and Parsons graphs[ J].Europ.J.Combin 1997,18:597-600.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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