紧优无向双环网络强彩虹连通数的下界估计  

A lower bound estimation about strong rainbow connectivity of optimal undirected double-loop networks

作　　者：刘杰 陈宝兴 钟玮 LIU Jie;CHEN Baoxing;ZHONG Wei(College of Computer Science,Minnan Normal University,Zhangzhou 363000,China;Sanming Medical and Polytechnic Vocational College,Sanming 365000,China;Key Laboratory of Data Science and Intelligence Application,Fujian Province University,Zhangzhou 363000,China)

机构地区：[1]闽南师范大学计算机学院,福建漳州363000 [2]三明医学科技职业学院,福建三明365000 [3]福建省高等学校数据与智能应用重点实验室,福建漳州363000

出　　处：《中山大学学报（自然科学版）（中英文）》2022年第5期159-164,共6页Acta Scientiarum Naturalium Universitatis Sunyatseni

基　　金：福建省高校科研专项项目(JK2017031);福建省中青年项目(JAT170361,JAT191506)。

摘　　要：对无向双环网络最短路径唯一表示问题进行刻画,给出了紧优无向双环网络具有最短路径表示的一个充要条件。最后证明了一类具有唯一最短路径表示的紧优无向双环网络,其强彩虹连通数必大于或等于该网络的直径加1。The uniqueness of the shortest path representation of an undirected double-loop network is characterized,and a necessary and sufficient condition for an optimal undirected double-loop network which has the shortest path representation is given.Finally,it is proven that for a class of optimal undirected double-loop networks which have the shortest path representation,its strong rainbow connection number is greater than or equal to the diameter of the network plus 1.

关 键 词：无向双环网络 最短路径 彩虹路 强彩虹连通数 

分 类 号：O157.5[理学—数学]