期刊文献+

Double图的撞击时间的期望值

Expected Hitting Time of Double Graphs
下载PDF
导出
摘要 令G为简单连通图,DG为其double图,称图G的随机游走从点u首次到达点v所需步数的期望值为点u到点v的撞击时间的期望值。本文给出了DG和G中任意两点撞击时间的期望值之间的关系。 Let G be a simple connected graph and let DG be its double graph. The expected hitting time from vertices u to v is the expected value of the minimum number of jumps the random walk needs from u to v. In this paper, a relation for the expected hitting time between any two vertices of DG and G is displayed.
作者 孙春雨
出处 《理论数学》 2021年第4期472-476,共5页 Pure Mathematics
  • 相关文献

参考文献1

二级参考文献14

  • 1[1]Bondy,J.A.,Murty,U.S.R.,Graph Theory With Application.New York:The Macmillan Press Ltd,1976.
  • 2[2]Tian Feng,Ma Zhongfan,The Theory of Graphs and Networks,The Press of Science,1987.
  • 3[3]Marek Kubale,Graph Coloring,American Mathematical Society Providence,Rhode Island,2004.
  • 4[4]Kostochka,A.V.,The total coloring of a multigraph with maximal degree 4,Discrete Mathematics,1977,17:161-163.
  • 5[5]Sanchez-Arroyo,A.,Determining the total colouring number is NP-haxd,Discrete Mathematics,1989,78:315-319.
  • 6[6]Yap,H.P.,Total colourings of graphs,Lecture Notes in Mathematics,vol.1623,Springer,Berlin,1996.
  • 7[7]Zhang Zhongfu,Zhang Jianxun,Wang Jianfang,The total chromatic number of some graph,Sci.Sinica Set.A,1988,31(12):1434-1441.
  • 8[8]Zhang Zhongfu,Wang Jianfang,A summary of the progress on total colorings of graphs,Adv.in math.(China),1992,21:390-397.
  • 9[9]Zhang Zhongfu,Liu Linzhong,Wang Jianfang,Adjacent strong edge coloring of graphs,Applied Mathematics Letters,2002,15:623-626.
  • 10[10]Hamed Hatami,A+300 is a bound on the adjacent vertex distinguishing edge chromatic number,Journal of Combinatorial Theory,Series B,2005,95:246-256.

共引文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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