Supported by the National Natural Science Foundation of China(12161073)。
A Gallai k-coloring is a k-edge-coloring of a complete graph in which there are no rainbow triangles.For given graphs G_(1),G_(2),G_(3)and nonnegative integers r,s,t with k=r+s+t,the k-colored Gallai-Ramsey number grk...
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 order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the average degree and the average path length of edge vertices of China aviation netwo...
In order to reveal the complex network characteristics and evolution principle of China aviation network,the probability distribution and evolution trace of arithmetic average of edge vertices nearest neighbor average...
In order to reveal the complex network characteristics and evolution principle of China aviation network, the probability distribution and evolution trace of ratio of China aviation network edge vertices degree were s...
In order to reveal the complex network characteristics and evolution principle of China aviation network, the probability distribution and evolution trace of average degree of edge vertices of China aviation network w...
Ng was supported in part by Hong Kong Research Grant Council General Research Fund(GRF),China(Nos.12300218,12300519,117201020,17300021,CRF C1013-21GF,C7004-21GF and Joint NSFC-RGC NHKU76921);Wu is supported by National Natural Science Foundation of China(No.62206111);Young Talent Support Project of Guangzhou Association for Science and Technology,China(No.QT-2023-017);Guangzhou Basic and Applied Basic Research Foundation,China(No.2023A04J1058);Fundamental Research Funds for the Central Universities,China(No.21622326);China Postdoctoral Science Foundation(No.2022M721343).
Graph neural networks have been shown to be very effective in utilizing pairwise relationships across samples.Recently,there have been several successful proposals to generalize graph neural networks to hypergraph neu...
Supported by the National Natural Science Foundation of China(12175068);Natural Science Foundation of Hebei Province,China(A2018502124)。
In this study,the strong coupling constants of vertices BBΥ,BB^(∗)Υ,B^(∗)B^(∗)Υ,BB^(∗)ηb,and B^(∗)B^(∗)ηb are analyzed in the framework of QCD sum rules.All possible off-shell cases and the contributions of vacuu...
The distance between two vertices u and v in a connected graph G is the number of edges lying in a shortest path(geodesic)between them.A vertex x of G performs the metric identification for a pair(u,v)of vertices in G...
When we stare into our complex surroundings, we see objects of different shapes and sizes. However, the shape that is always present, regardless of the complexity of the object, is the circle. The circle is arguably t...