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 ...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.展开更多
Under some conditions on probability, this note discusses the equivalence between the complete convergence and the law of large number for B-valued independent random elements. The results of [10] become a simple coro...Under some conditions on probability, this note discusses the equivalence between the complete convergence and the law of large number for B-valued independent random elements. The results of [10] become a simple corollary of the results here. At the same time, the author uses them to investigate the equivalence of strong and weak law of large numbers, and there exists an example to show that the conditions on probability are weaker.展开更多
基金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.
文摘Under some conditions on probability, this note discusses the equivalence between the complete convergence and the law of large number for B-valued independent random elements. The results of [10] become a simple corollary of the results here. At the same time, the author uses them to investigate the equivalence of strong and weak law of large numbers, and there exists an example to show that the conditions on probability are weaker.
