期刊文献+

强乘积图的最小强半径

Minimum Strong Radius of Strong Product Graphs
下载PDF
导出
摘要 A strong product graph is denoted by G_(1)■G_(2),where G_(1) and G_(2) are called its factor graphs.This paper gives the range of the minimum strong radius of the strong product graph.And using the relationship between the cartesian product graph G_(1)■G_(2) and the strong product graph G_(1)■G_(2),another different upper bound of the minimum strong radius of the strong product graph is given.
作者 刘树洋 李峰 LIU Shu-yang;LI Feng(College of Computer Science,Qinghai Normal University,Xining 810000,China;The State Key Laboratory of Tibetan Intelligent Information Processing and Application,Xining 810000,China)
出处 《Chinese Quarterly Journal of Mathematics》 2024年第1期68-72,共5页 数学季刊(英文版)
基金 Supported by National Natural Science Foundation of China(Grant No.11551002) Natural Science Foundation of Qinghai Province(Grant No.2019-ZJ-7093)。
  • 相关文献

参考文献2

二级参考文献10

  • 1Bang-Jensen J, Gutin G. Digraphs: Theory, Algorithms and Applications[M]. Springer, London, 2000.
  • 2Chartrand G, Erwin D, Raines M, Zhang P. Strong Distance in Strong Digraphs[J]. J Combin Math Combin Comput, 1999, 31: 33-44.
  • 3Chartrand G, Erwin D, Raines M, Zhang P. On Strong Distance in Strong Oriented Graphs[J]. Congr Numer, 1999, 138: 49-63.
  • 4Chen Meirun, Guo Xiaofeng, Li Hao. Bounds on Strong Diameter in Oriented Graphs. Applied Mathematics Letters, in press.
  • 5Chen Meirun, Guo Xiaofeng. Lower and Upper Orientable Strong Radius and Strong Diameter of Cartesian Product of Complete Graphs. Ars Combinatoria, in press.
  • 6Peter Dankelmann, Henda C. Swart, David P. Day. On Strong Distance in Oriented Graphs[J1. Discrete Math, 2003, 266: 195-201.
  • 7Lai Yungling, Chiang Fenghsu, Lin Chuhe, Yu Tungchin. Strong Distance of Complete Bipartite Graphs, The 19th Workshop on Combinatorial Mathematics and Computation Theory[M]. 2002, 12-16.
  • 8Miao Huifang, Guo Xiaofeng. Lower and Upper Orientable Strong Radius and Strong Diameter of Complete k-Partite Graphs[J]. Discrete Applied Mathematics, 2006, 154(11): 1606-1614.
  • 9Miao Huifangl Guo Xiaofeng. Strong Distance in Strong Oriented Complete k-Partite Graphs. Ars Combinatoria, in press.
  • 10李峰,彭毅,赵海兴.一类多重字典乘积网络的支撑树计数[J].软件,2011,32(7):51-53. 被引量:2

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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