Results 71 to 80 of about 25,758 (195)

Energies of Hypergraphs

open access: yesThe Electronic Journal of Linear Algebra, 2020
In this paper, energies associated with hypergraphs are studied. More precisely, results are obtained for the incidence and the singless Laplacian energies of uniform hypergraphs. In particular, bounds for the incidence energy are obtained as functions of well known parameters, such as maximum degree, Zagreb index and spectral radius.
Kauê Cardoso, Vilmar Trevisan
openaire   +4 more sources

A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs

open access: yesCAAI Transactions on Intelligence Technology, Volume 11, Issue 2, Page 396-410, April 2026.
ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie   +5 more
wiley   +1 more source

Split Hypergraphs

open access: yesSIAM Journal on Discrete Mathematics, 2008
13 ...
openaire   +2 more sources

Hypergraphs with arbitrarily small codegree Turán density

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.
Abstract The codegree Turán density γ(F)$\gamma (F)$ of a k$k$‐graph F$F$ is the smallest γ∈[0,1)$\gamma \in [0,1)$ such that every k$k$‐graph H$H$ with δk−1(H)⩾(γ+o(1))|V(H)|$\delta _{k-1}(H)\geqslant (\gamma +o(1))\vert V(H)\vert$ contains a copy of F$F$. In this work, we show that for every ε>0$\varepsilon >0$, there is a k$k$‐uniform hypergraph F$F$
Simón Piga, Bjarne Schülke
wiley   +1 more source

Study on the reliability of hypergraphs based on non-backtracking matrix centrality

open access: yes网络与信息安全学报
In recent years, there has been widespread attention on hypergraphs as a research hotspot in network science.The unique structure of hypergraphs, which differs from traditional graphs, is characterized by hyperedges that can connect multiple nodes ...
Hao PENG, Cheng QIAN, Dandan ZHAO, Ming ZHONG, Jianmin HAN, Ziyi XIE, Wei WANG
doaj   +3 more sources

Hypergraph Representation via Axis-Aligned Point-Subspace Cover [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
We propose a new representation of $k$-partite, $k$-uniform hypergraphs, that is, a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly one vertex of each type; we call them $k$-hypergraphs for short.
Oksana Firman, Joachim Spoerhase
doaj   +1 more source

Predicting Multi-actor collaborations using Hypergraphs [PDF]

open access: yes, 2014
Social networks are now ubiquitous and most of them contain interactions involving multiple actors (groups) like author collaborations, teams or emails in an organizations, etc.
Chandra, Abhishek   +2 more
core  

Discrepancy of arithmetic progressions in boxes and convex bodies

open access: yesMathematika, Volume 72, Issue 2, April 2026.
Abstract The combinatorial discrepancy of arithmetic progressions inside [N]:={1,…,N}$[N]:= \lbrace 1, \ldots, N\rbrace$ is the smallest integer D$D$ for which [N]$[N]$ can be colored with two colors so that any arithmetic progression in [N]$[N]$ contains at most D$D$ more elements from one color class than the other.
Lily Li, Aleksandar Nikolov
wiley   +1 more source

Hypergraph animals

open access: yesPhysical Review E
Here we introduce simple structures for the analysis of complex hypergraphs, hypergraph animals. These structures are designed to describe the local node neighbourhoods of nodes in hypergraphs. We establish their relationships to lattice animals and network motifs, and we develop their combinatorial properties for sparse and uncorrelated hypergraphs ...
openaire   +3 more sources

f$f$‐Diophantine sets over finite fields via quasi‐random hypergraphs from multivariate polynomials

open access: yesMathematika, Volume 72, Issue 2, April 2026.
Abstract We investigate f$f$‐Diophantine sets over finite fields via new explicit constructions of families of quasi‐random hypergraphs from multivariate polynomials. In particular, our construction not only offers a systematic method for constructing quasi‐random hypergraphs but also provides a unified framework for studying various hypergraphs ...
Seoyoung Kim, Chi Hoi Yip, Semin Yoo
wiley   +1 more source

Home - About - Disclaimer - Privacy