云南高校图书馆联盟文献共享服务平台- HYPERGRAPHS

HYPERGRAPHS: 作品数：50被引量：23H指数：3; 导出分析报告; 相关作者：柳柏濂更多>>; 相关机构：华南师范大学更多>>; 相关期刊：《Acta Mathematicae Applicatae Sinica》《Chinese Annals of Mathematics,Series B》《Chinese Quarterly Journal of Mathematics》《Journal of the Operations Research Society of China》更多>>; 相关基金：国家自然科学基金国家教育部博士点基金中国博士后科学基金美国国家科学基金更多>>

On the Coprime Labelings of Hypergraph: 《Wuhan University Journal of Natural Sciences》2025年第1期57-59,共3页ZHANG Zizhou ZHANG Shaohua; 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...; 关键词：coprime mapping theorem of Pomerance and Selfridge linear hypergraphs prime hypergraphs

The Weighted Embedded Homology of Super-Hypergraphs: 《Wuhan University Journal of Natural Sciences》2024年第6期523-528,共6页WANG Chong; 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...; 关键词：△-set super-hypergraph weighted embedded homology PSEUDO-METRIC

Influencer Identification of Threshold Models in Hypergraphs: 《Journal of Mathematical Research with Applications》2024年第5期569-582,共14页Xiaojuan SONG Xilong QU Ting WEI Jilei TAI Renquan ZHANG; 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 ...; 关键词：HYPERGRAPH threshold model influence maximization information diffusion sub-critical path

An Upper Bound for the Transversal Number of Connected k-Uniform Hypergraphs: 《Journal of the Operations Research Society of China》2024年第3期829-835,共7页Zi-An Chen Bin Chen; supported by the National Natural Science Foundation of China(No.12171089).; Let H be a hypergraph with vertex set V(H)and hyperedge set E(H).We call a vertex set R ■V(H)a transversal if it has a nonempty intersection with every hyperedge of H.The transversal number,denoted by τ(H),is the mi...; 关键词：Transversal number k-uniform hypergraph Perfect matching

IMVis: Visual analytics for influence maximization algorithm evaluation in hypergraphs: 《Visual Informatics》2024年第2期13-26,共14页Jin Xu Chaojian Zhang Ming Xie Xiuxiu Zhan Luwang Yan Yubo Tao Zhigeng Pan; Zhejiang Provincial Natural Science Foundation of China(LQ22F020017);National Natural Science Foundation of China(62302137);Open Project Program of the State Key Lab of CAD&CG of Zhejiang University(A2104).; Influence maximization(IM)algorithms play a significant role in hypergraph analysis tasks,such as epidemic control analysis,viral marketing,and social influence analysis,and various IM algorithms have been proposed.Th...; 关键词：Influence maximization evaluation Comparative visual analysis Visual analytics

Stability and Generalization of Hypergraph Collaborative Networks: 《Machine Intelligence Research》2024年第1期184-196,共13页Michael K.Ng Hanrui Wu Andy Yip; 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...; 关键词：HYPERGRAPHS VERTICES hyperedges collaborative networks graph convolutional neural networks(CNNs) STABILITY generalization guarantees

The Erdös-Faber-Lovász Conjecture for Gap-Restricted Hypergraphs: 《Engineering（科研）》2024年第2期47-59,共13页Zhimin Wang; An edge coloring of hypergraph H is a function such that holds for any pair of intersecting edges . The minimum number of colors in edge colorings of H is called the chromatic index of H and is denoted by . Erdös, ...; 关键词：Linear Hypergraph Chromatic Index Erdös-Faber-Lovász Conjecture Edge Cardinality

A Note on Edge Coloring of Linear Hypergraphs: 《Journal of Mathematical Research with Applications》2023年第5期535-541,共7页Qi WANG Xia ZHANG; Supported by the National Natural Science Foundation of China (Grant No. 12071265);the Natural Science Foundation of Shandong Province (Grant No. ZR2019MA032)。; A k-edge coloring of a hypergraph H is a coloring of the edges of H with k colors such that any two intersecting edges receive distinct colors. The Erdos-Faber-Lovasz conjecture states that every loopless linear hyper...; 关键词：linear hypergraph edge coloring Erdos-Faber-Lovasz conjecture

On the Turán Density of Uniform Hypergraphs: 《Acta Mathematicae Applicatae Sinica》2023年第3期638-646,共9页An CHANG Guo-rong GAO; the National Natural Science Foundation of China(No.12171089)。; Let p,q be two positive integers.The 3-graph F(p,q)is obtained from the complete 3-graph K_(p)^(3)by adding q new vertices and P_(q/2)new edges of the form vxy for which v∈V(K_p~3)and{x,y}are new vertices.It frequent...; 关键词：HYPERGRAPH Turán density BOUND

Discrete Differential Calculus on Simplicial Complexes and Constrained Homology: 《Chinese Annals of Mathematics,Series B》2023年第4期615-640,共26页Shiquan REN; supported by China Postdoctoral Science Foundation(No.2022M721023)。; Let V be a finite set.Let K be a simplicial complex with its vertices in V.In this paper,the author discusses some differential calculus on V.He constructs some constrained homology groups of K by using the differenti...; 关键词：Simplicial complexes HYPERGRAPHS Chain complexes HOMOLOGY Differential calculus

HYPERGRAPHS