期刊文献+

双图的一些脆弱性参数(英文)

Vulnerability Parameters of Double Graphs
下载PDF
导出
摘要 一个图G的双图(double graphs)的定义为D[G]=G×T_2,这里×表示图的直积,而T_2表示两个顶点的全图.本文研究了图的双图的一些脆弱性参数. The double graph is defined as :D[G] = G × T2, where × stands for direct product of graphs and T2 is a total graph with 2 vertices. In this paper, we study some graphical parameters of double graphs.
出处 《新疆大学学报(自然科学版)》 CAS 2009年第3期290-296,共7页 Journal of Xinjiang University(Natural Science Edition)
关键词 双图 支配数 离散度 完整度 Double graph domination number scattering number integrity
  • 相关文献

参考文献10

  • 1Cozzens M,Moazzami D,Stueckle S.The tenacity of a graph[].ProcSeventh International Confon the Theory and Application of Graphs.1995
  • 2West D.B.Introduction to Graph Theory[]..2004
  • 3Bagga K S,Beineke L W,Goddard W D,et al.A survey of integrity[].Discrete Applied Mathematics.1992
  • 4Barefoot C A,Entringer R,Swart H.Vulnerability in graphs-a comparative survey[].Journal of Combinatorial Mathematics and Combinatorial Computing.1987
  • 5Chvatal.Tough graphs and hamiltonian circulits[].Discrete Mathematics.1973
  • 6E. Munarini,C. Cippo,A. Scagliola,N. Z. Salvi.Double graphs[].Discrete Mathematics.2008
  • 7K. S. Bagga L. W. Beineke M. J. Lipman and R. E. Pippert.Edge-integrity: a survey[].Discrete Mathematics.1994
  • 8Jung,H. A.On a class of posets and the corresponding comparability graphs[].J Combinatorial Theory Ser B.1978
  • 9PIAZZA B L,ROBERTS F S,STUECKLE S K.Edge tenacious networks[].Networks.1995
  • 10Li Y,Zhang S,Li X.Rupture degree of graphs[].Int Comput Math.2005

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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