期刊文献+

变换图G^(*xy)的基本性质

Basic Properties of Transformation Graphs
下载PDF
导出
摘要 图G的变换图G*xy以V(G)∪E(G)为其顶点集,x,y∈{+,-}·对任意的α,β∈V(G)∪E(G),α和β在图G*xy中邻接的条件如下:(ⅰ)α,β∈V(G)·(ⅱ)α,β∈E(G),x=+时当且仅当α和β在图G中相邻;x=-时当且仅当α和β在图G中不相邻·(ⅲ)α∈V(G),β∈E(G),y=+时当且仅当α和β在图G中关联;y=-时当且仅当α和β在图G中不关联·主要介绍了四类变换图,其中一个恰是中图M(G)的补图,并探讨了这些变换图的一些基本性质· The transformation graph G^*xy of G is the graph with vertex set V(G) E(G), and x, y be two variables taking values + or -. For α, β∈V(G) ∪ E(G), α and β are adjacent in G^*xy if and only if one of the following holds: ( i ) α,β∈ V(G).(ii)α,β∈ E(G).α and β are adjacent in G if x = +;α and β are not adjacent in G if x = -. (iii) α∈ V(G),β∈ E(G). α and β are incident in G if y = + ; α and β are not incident in G if y = - . In this paper, we introduce four kinds of transformation graphs, one of which is the complement of middle graph M(G). We investigate some basic proper ties of these transformation graphs.
作者 顾秀松 杨阳
出处 《怀化学院学报》 2009年第8期10-13,共4页 Journal of Huaihua University
基金 江苏省研究生创新计划 江南大学青年基金(NO2008LQN008)
关键词 变换图 连通性 直径 正则性 transformation graph connectedness diameters regularity
  • 相关文献

参考文献4

二级参考文献14

  • 1[1]Bondy J A, Murty M R. Graph theory and Its Application, Academic Press, 1976 被引量:1
  • 2[2]Ales J, Bacik R. Strong elimination orderings of the total graph of a tree, Discrete Appl. Math. 1992, 39:293~295 被引量:1
  • 3[3]Baur D, Tindell R. The connectivity of line graphs and total graphs, J. Graph Theory 1982, 6:197~204 被引量:1
  • 4[4]Behzad M. Graphs and their chromatic numbers, Ph.D. thesis, Michigan State University, 1965 被引量:1
  • 5[5]Behzad M, Chartrand G. Proc. Edinburgh Math. Soc. 1966/67, 15:117~120 被引量:1
  • 6[6]Iqbalunnisa T, Janakiraman N, Srinivasan N. Note on iteralted total graphs, J. Indian Math. Soc. New Ser. 1990, 55:67~71 被引量:1
  • 7[7]Gudagudi B R, Stewart M J. On n-th subdivision graphs, J. Karmatak Univ. Sci. 1974, 19:282~288 被引量:1
  • 8[8]Van Rooij A C M, Wilf H S. The interchange graph of a finite graph, Acta Mate. Acad. Sci. Hungar. 1965, 16:163~169 被引量:1
  • 9Boesch F.Synthesis of reliable networks-a survey[J].IEEE Transactions on Reliability,1986,35:240-246. 被引量:1
  • 10Ball M O.Complexity of network reliability computation[J].Networks,1980(10):153-165. 被引量:1

共引文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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