Results 1 to 10 of about 8,099 (222)
Discussiones Mathematicae Graph Theory, 2016 If D = (V,A) is a digraph, its niche hypergraph NH(D) = (V, E) has the edge set ℇ = {e ⊆ V | |e| ≥ 2 ∧ ∃ v ∈ V : e = N−D(v) ∨ e = N+D(v)}. Niche hypergraphs generalize the well-known niche graphs (see [11]) and are closely related to competition ...
Garske Christian +2 more
doaj +6 more sources
Heliyon, 2022 Topological invariants are numerical parameters of graphs or hypergraphs that indicate its topology and are known as graph or hypergraph invariants. In this paper, topological indices of hypergraphs such as Wiener index, degree distance index and Gutman ...
Sakina Ashraf +3 more
doaj +2 more sources
Lagrangians of Hypergraphs [PDF]
Combinatorics, Probability and Computing, 2002 How large can the Lagrangian of an r-graph with m edges be? Frankl and Füredi [1] conjectured that the r-graph of size m formed by taking the first m sets in the colex ordering of N(r) has the largest Lagrangian of all r-graphs of size m. We prove the first ‘interesting’ case of this conjecture, namely that the 3-graph with (t3) edges and ...
Talbot, JM
openaire +3 more sources
Signless normalized Laplacian for hypergraphs
Electronic Journal of Graph Theory and Applications, 2022 The spectral theory of the normalized Laplacian for chemical hypergraphs is further investigated. The signless normalized Laplacian is introduced and it is shown that its spectrum for classical hypergraphs coincides with the spectrum of the normalized ...
Eleonora Andreotti, Raffaella Mulas
doaj +3 more sources
Contributions to Discrete Mathematics, 2023 This article presents an extension of the study of metric and partition dimension to hypergraphs. We give sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified conditions.
Imran Javaid +3 more
core +6 more sources
Complex Neutrosophic Hypergraphs: New Social Network Models
Algorithms, 2019 A complex neutrosophic set is a useful model to handle indeterminate situations with a periodic nature. This is characterized by truth, indeterminacy, and falsity degrees which are the combination of real-valued amplitude terms and complex-valued phase ...
Anam Luqman +2 more
exaly +3 more sources
Community detection in hypergraphs through hyperedge percolation [PDF]
Scientific ReportsComplex networks often exhibit community structure, with communities corresponding to denser subgraphs in which nodes are closely linked. When modelling systems where interactions extend beyond node pairs to arbitrary numbers of nodes, hypergraphs become
Bianka Kovács +2 more
doaj +2 more sources
q-Rung Orthopair Fuzzy Hypergraphs with Applications
Mathematics, 2019 The concept of q-rung orthopair fuzzy sets generalizes the notions of intuitionistic fuzzy sets and Pythagorean fuzzy sets to describe complicated uncertain information more effectively.
Anam Luqman +2 more
exaly +3 more sources
Decomposing hypergraphs into k-colorable hypergraphs [PDF]
Transactions on Combinatorics, 2014 For a given hypergraph $H$ with chromatic number $chi(H)$ and with no edge containing only one vertex, it is shown that the minimum number $l$ for which there exists a partition (also a covering) ${E_1,E_2,ldots,E_l}$ for $E(H)$, such that the ...
Gholamreza Omidi , Khosro Tajbakhsh
doaj +2 more sources
Hypergraph convolution and hypergraph attention [PDF]
Pattern Recognition, 2021 Recently, graph neural networks have attracted great attention and achieved prominent performance in various research fields. Most of those algorithms have assumed pairwise relationships of objects of interest. However, in many real applications, the relationships between objects are in higher-order, beyond a pairwise formulation.
Song Bai 0001 +2 more
openaire +3 more sources