Reciprocal Distance Laplacian Eigenvalue Distribution Based on Graph Parameters  

基于图参数的倒数距离拉普拉斯特征值的分布

作　　者：CUI Jiaxin MA Xiaoling 崔嘉欣;马小玲(新疆大学数学与系统科学学院,新疆乌鲁木齐830017)

机构地区：[1]School of Mathematics and System Sciences,Xinjiang University,Urumqi Xinjiang 830017,China

出　　处：《新疆大学学报（自然科学版中英文）》2024年第5期562-570,共9页Journal of Xinjiang University(Natural Science Edition in Chinese and English)

基　　金：supported by the Natural Science Foundation of Xinjiang Uygur Autonomous Region of China“Graph problems of topological parameters based on the spectra of graph matrices”(2021D01C069);the National Natural Science Foundation of the People's Republic of China“The investigation of spectral properties of graph operations and their related problems”(12161085)。

摘　　要：Let G be a connected graph of order n and m_(RD)^(L)_(G)I denote the number of reciprocal distance Laplacian eigenvaluesof G in an interval I.For a given interval I,we mainly present several bounds on m_(RD)^(L)_(G)I in terms of various structuralparameters of the graph G,including vertex-connectivity,independence number and pendant vertices.中文摘要:设图G是n个点的连通图,记m_(RD)^(L)_(G)I为图G的倒数距离拉普拉斯特征值在区间I上的个数.对于给定的区间I,根据图G的一些结构参数,如点连通度、独立数和悬挂点的个数,主要给出了m_(RD)^(L)_(G)I一些界.

关 键 词：reciprocal distance Laplacian eigenvalue VERTEX-CONNECTIVITY independence number pendant vertices 

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