Supported by the Natural Science Foundation of Chongqing(CSTB2022NSCQ-MSX0884)。
Graph labeling is the assignment of integers to the vertices,edges,or both,subject to certain conditions.Accordingly,hypergraph labeling is also the assignment of integers to the vertices,edges,or both,subject to cert...
supported by the National Key Research and Development Program of China(No.2021ZD0200300);the National Nature Science Foundation of China(Nos.61836004 and 62088102);the IDG/McGovern Institute for Brain Research at Tsinghua University,China.
Given the escalating intricacy and multifaceted nature of contemporary social systems,manually generating solutions to address pertinent social issues has become a formidable task.In response to this challenge,the rap...
supported by the Anhui Province University Collaborative Innovation Project(No.GXXT-2022-091);the National Natural Science Foundation of China(No.62006003);the Natural Science Foundation of Anhui Province(No.2208085QF197);the Key Project of Nature Science Research for Universities of Anhui Province of China(Nos.2022AH040019 and 2022AH05008637);the Hefei Key Common Technology Project(No.GJ2022GX15).
Recent years have seen growing demand for the use of edge computing to achieve the full potential of the Internet of Things(IoTs),given that various IoT systems have been generating big data to facilitate modern laten...
Supported by Natural Science Foundation of HuBei Province(2022CFB299).
This paper studies the problem of the spectral radius of the uniform hypergraph determined by the signless Laplacian matrix.The upper bound of the spectral radius of a uniform hypergraph is obtained by using Rayleigh ...
supported by the Institute for Basic Science(IBS-R029-C4);supported by the National Key Research and Development Program of China(Grant No.2020YFA0712100);National Natural Science Foundation of China(Grant No.12231014);Beijing Scholars Program。
The Turán problem asks for the largest number of edges ex(n,H)in an n-vertex graph not containing a fixed forbidden subgraph H,which is one of the most important problems in extremal graph theory.However,the order of...
supported by National Natural Science Foundation of China(Grant No.12071077)。
Let r≥2 be an integer.The real numberα∈[0,1)is a jump for r if there exists a constant c>0 such that for any?>0 and any integer m≥r,there exists an integer n_0(ε,m)satisfying any r-uniform graph with n≥n_0(ε,m)...
Supported by the Science and Technology Project of Hebei Education Department (ZD2022168);the Research and Innovation Team of Cang‐zhou Normal University (cxtdl2304)。
In this paper,we define the weighted embedded homology of super-hypergraphs,give a quasi-partial order and a pseudo-metric on the set made up of all non-vanishing weights on a finite set,and clarify the relationship b...
supported by the National Key Research and Development Program of China(No.2021YFE0102100);the National Natural Science Foundation of China(Nos.62322301,62172002,and 82060373);the Outstanding Youth Research Project of Universities in Anhui Province(No.2022AH020010);the University Synergy Innovation Program of Anhui Province(Nos.GXXT-2022-035 and GXXT-2021-039);the Xinjiang Tianshan Project(No.2022TSYCLJ0032).
In the field of cancer treatment,drug combination therapy appears to be a promising treatment strategy compared to monotherapy.Recently,plenty of computational models are gradually applied to prioritize synergistic dr...
supported by National Natural Science Foundation of China(No.61806006);Priority Academic Program Development of Jiangsu Higher Education Institutions。
The existing multi-view subspace clustering algorithms based on tensor singular value decomposition(t-SVD)predominantly utilize tensor nuclear norm to explore the intra view correlation between views of the same sampl...
Supported by the National Natural Science Foundation of China(Grant No.12371516);the Natural Science Foundation of Liaoning Province(Grant No.2022-MS-152);the Fundamental Research Funds for the Central Universities(Grant No.DUT22LAB305)。
This paper mainly studies the influence maximization problem of threshold models in hypergraphs,which aims to identify the most influential nodes in hypergraphs.Firstly,we introduce a novel information diffusion rule ...