期刊文献+

上连通和超连通六次点传递图(英文) 被引量:1

Superconnected and Hyperconnected 6-Regular Transitive Graphs
下载PDF
导出
摘要 图G称为上连通的,若对每个最小割集C,G-C有孤立点.G称为超连通的,若对每个最小割集C,G-C恰有两个连通分支,且其中之一为孤立点.本文刻画了上连通或超连通六次点传递图. A graph G is said to be superconnected if for every minimum vertex cut C , G--C has isolated vertices. G is said to be hyperconnected if for every minimum vertex cut C of G , G -- C has exactly two components one of which is an isolated vertex. In this paper, we characterize superconnected or hyperconnected vertex transitive graphs with degree 6.
出处 《新疆大学学报(自然科学版)》 CAS 2008年第3期253-262,共10页 Journal of Xinjiang University(Natural Science Edition)
基金 NSFC (No.10671165) XJEDU (No.2004G05)
关键词 上连通 超连通 超原子 点传递图 Superconnected graph hyperconnected superatom transitive graph
  • 相关文献

参考文献9

  • 1Boesch F. On unreliability polynomials and graph connectivity in reliable network synthesis[J].Graph Theory, 1986, 10: 339-352.
  • 2Boesch F. Synthesis of reliable networks-a survey[J]. IEEE Trans Reliable, 1986. 35: 240-246.
  • 3Mader M. Minimal n-fach Kantenzusammenhangenden Granphen [J]. Math Ann, 1971, 191:21-28.
  • 4Tindell R. Connectivity of Cayley graphs [M].in:D. Z. Du, D. F, Hsu (eds.),Combinatorial Network Theory, 1996, 41-64.
  • 5Meng Jixiang. Connevtivity of vertex and edge transitive graphs[J].Discrete Applied Mathematics, 2003, 127:601- 613.
  • 6王大猛,孟吉翔.上连通和超连通三次点传递图[J].运筹学学报,2001,5(4):35-40. 被引量:3
  • 7Hamidone Y O. Subsets with small sums in abelian groups'I: the vosper property [J]. Europ Combin, 1997, 4:541- 556.
  • 8Chen Liang. The Connectivity of Vertex-transitive Graphs with Small Regular Degrees[J].Xinjiang University, 2000,4:5-7.
  • 9Lakshmivaraham S, Jwo Jung-Sing, Dhall S K. Symmetry in interconnection networks on Cayley graphs of permutation groups: a survey [J].Parallel Comput, 1993, 19:361-407.

二级参考文献1

  • 1Tindell R,Connectivity of Cayley graphs, in Combinatorial Network Theory,1996年,41页

共引文献2

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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