一类3正则图的Balaban指数OA北大核心CSTPCD
Balaban Index of a Kind of 3-regular Graph
本文解决了3正则图Ln的Balaban指数计算问题.采用分类讨论的方法,给出了Ln的Balaban指数计算公式,并利用该公式,分别得到了该类正则图Balaban指数的易于计算的上、下界.计算结果表明,本文所得上界优于已有文献所给出的结果,且当图的阶数大于等于42时,该上界与精确值相差不超过0.1.
This paper solves the computing problems of Balaban index for 3-regular graph Ln.By using the method of classification discussion,a formula for the Balaban index of Ln is given and the upper and lower bounds that are easy to compute is acquired from this formula.The results show that the upper bound obtained in this paper is superior to the existing one,and if the order is greater than or equal to 42,the difference between the upper bound and the exact value is less than 0.1.
武军秀;高玉斌
中北大学 数学学院,山西 太原 030051
数学
Balaban指数3正则图距离上、下界
Balaban index3-regular graphdistanceupper and lower bound
《山西大学学报（自然科学版）》 2024 (005)
935-942 / 8
山西省回国留学人员科研项目(2022-149);山西省自然科学基金(20210302124212)
评论