Results 21 to 30 of about 14,067 (220)
Super edge-magic labeling for 𝒌-uniform, complete 𝒌-uniform and complete 𝒌-uniform 𝒌-partite hypergraphs [PDF]
Let 𝐻 be a hypergraph with a vertex set 𝑉 and a hyperedge set 𝐸. Generalized from the super edge-magic in a graph, we say that a hypergraph 𝐻 is super edge-magic if there is a bijection 𝑓: 𝑉 ∪ 𝐸 → {1,2,3, … , |𝑉| + |𝐸|} which satisfies: (i) there exists
Ratinan Boonklurb +2 more
doaj +1 more source
Complexity science provides a powerful framework for understanding physical, biological and social systems, and network analysis is one of its principal tools. Since many complex systems exhibit multilateral interactions that change over time, in recent years, network scientists have become increasingly interested in modelling and ...
Corinna Coupette +2 more
openaire +5 more sources
Hypergraph Turán Problems in ℓ2-Norm [PDF]
There are various different notions measuring extremality of hypergraphs. In this survey we compare the recently introduced notion of the codegree squared extremal function with the Turán function, the minimum codegree threshold and the uniform Turán ...
Clemen, Felix Christian +2 more
core
Spatial data processing often requires massive datasets, and the task/data scheduling efficiency of these applications has an impact on the overall processing performance.
Bo Cheng, Xuefeng Guan, Huayi Wu, Rui Li
doaj +1 more source
The notion of pattern hypergraph provides a unified view of several previously studied coloring concepts. A pattern hypergraph $H$ is a hypergraph where each edge is assigned a type $\Pi_i$ that determines which of possible colorings of the edge are proper. A vertex coloring of $H$ is proper if it is proper for every edge.
Zdenek Dvorák 0001 +3 more
openaire +2 more sources
Artificial intelligence (AI) based drug design has demonstrated great potential to fundamentally change the pharmaceutical industries. Currently, a key issue in AI-based drug design is efficient transferable molecular descriptors or fingerprints.
Xia, Kelin
core +1 more source
Infection in hypergraphs [PDF]
In this paper a new parameter for hypergraphs called hypergraph infection is defined. This concept generalizes zero forcing in graphs to hypergraphs. The exact value of the infection number of complete and complete bipartite hypergraphs is determined. A formula for the infection number for interval hypergraphs and several families of cyclic hypergraphs
Ryan Bergen +7 more
openaire +3 more sources
Learnable Hypergraph Laplacian for Hypergraph Learning
HyperGraph Convolutional Neural Networks (HGCNNs) have demonstrated their potential in modeling high-order relations preserved in graph structured data. However, most existing convolution filters are localized and determined by the pre-defined initial hypergraph topology, neglecting to explore implicit and long-ange relations in real-world data.
Jiying Zhang +4 more
openaire +4 more sources
Uniform hypergraphs containing no grids [PDF]
A hypergraph is called an r×r grid if it is isomorphic to a pattern of r horizontal and r vertical lines, i.e.,a family of sets {A1, ..., Ar, B1, ..., Br} such that Ai∩Aj=Bi∩Bj=φ for 1 ...
Füredi, Zoltán, Ruszinkó, Miklós
core +1 more source
Characterizing the hypergraph-of-entity and the structural impact of its extensions
The hypergraph-of-entity is a joint representation model for terms, entities and their relations, used as an indexing approach in entity-oriented search.
José Devezas, Sérgio Nunes
doaj +1 more source

