复杂网络中k-单圈图的若干性质  

Some properties of k-unicyclic graphs in complex networks

作　　者：姚明[1] 苏静 姚兵 YAO Ming;SU Jing;YAO Bing(College of Information Process and Control Engineering,Lanzhou Petrochemical Polytechnic,Lanzhou 730060,China;School of Electronics Engineering and Computer Science,Peking University,Beijing 100871,China;Key Laboratory of High Confidence Software Technologies,Peking University,Beijing 100871,China;College of Mathematics and Information Science,Northwest Normal University,Lanzhou 730070,China)

机构地区：[1]兰州石化职业技术学院信息处理与控制工程学院,甘肃兰州730060 [2]北京大学信息科学技术学院,北京100871 [3]北京大学高可信软件技术教育部重点实验室,北京100871 [4]西北师范大学数学与统计学院,甘肃兰州730070

出　　处：《东北师大学报（自然科学版）》2022年第1期9-13,共5页Journal of Northeast Normal University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(61163053,61353060);甘肃省财政专项资金资助项目(2014-63).

摘　　要：研究了复杂网络中k-单圈图问题,给出了k-单圈图的充要条件,并进一步探索了k-单圈图的若干性质.The k-unicyclic graphs problem is studied.Some sufficient and necessary conditions on k-unicyclic graphs are given and some properties of k-unicyclic graphs are charcaterized.

关 键 词：网络 树 叶子 单圈图 直径 

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