Results 31 to 40 of about 8,099 (222)
Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges
Discussiones Mathematicae Graph Theory, 2016 In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs ...
Fan Yi-Zheng +3 more
doaj +1 more source
Effective epidemic containment strategy in hypergraphs
Physical Review Research, 2021 Recently, hypergraphs have attracted considerable interest from the research community as a generalization of networks capable of encoding higher-order interactions, which commonly appear in both natural and social systems.
Bukyoung Jhun
doaj +1 more source
On partitioning of hypergraphs
Discrete Mathematics, 2007 The edge-isoperimetric problem on graphs (EIP), namely for a given integer \(m\) and graph \(G=(V,E)\) to find a subset \(A\) of the vertices of \(G\) of cardinality \(m\) so that the number of edges of \(G\) connecting vertices in \(A\) to vertices in \(V\setminus A\), is minimized (version 1), or such that the number of edges of \(G\) induced by \(A\)
S. Bezrukov, Battiti, Roberto
openaire +3 more sources
On Matchings in Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2012 We show that if the largest matching in a $k$-uniform hypergraph $G$ on $n$ vertices has precisely $s$ edges, and $n>2k^2s/\log k$, then $H$ has at most $\binom n k - \binom {n-s} k $ edges and this upper bound is achieved only for hypergraphs in which the set of edges consists of all $k$-subsets which intersect a given set of $s$ vertices.
Peter Frankl +2 more
openaire +2 more sources
Learnable Hypergraph Laplacian for Hypergraph Learning
ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2022 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 +3 more sources
Directed n-Superhypergraphs Incorporating Bipolar Fuzzy Information: A Multi-Tier Framework for Modeling Bipolar Uncertainty in Complex Networks [PDF]
Neutrosophic Sets and SystemsGraph theory studies the mathematical structures of vertices and edges to model relationships and connectivity. Hypergraphs extend this framework by allowing hyperedges to connect arbitrarily many vertices at once [1], and Super-HyperGraphs further ...
Florentin Smarandache, Takaaki Fujita
doaj +1 more source
A Theoretical Investigation Based on the Rough Approximations of Hypergraphs
Journal of Mathematics, 2022 Rough sets are a key tool to model uncertainty and vagueness using upper and lower approximations without predefined functions and additional suppositions.
Musavarah Sarwar
doaj +1 more source
On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs [PDF]
Transactions on Combinatorics, 2022 In this paper, we delve into studying some relations between the structure of the cycles and spanning trees of a graph through the lens of its cycle and spanning tree hypergraphs which are hypergraphs with the edge set of the graph as their vertices ...
Alireza Mofidi
doaj +1 more source
Journal of Pure and Applied Algebra, 2019 38 ...
Brendan Fong, David I. Spivak
openaire +4 more sources
A Note on Packing of Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2022 We say that two n-vertex hypergraphs H1 and H2 pack if they can be found as edge-disjoint subhypergraphs of the complete hypergraph Kn. Whilst the problem of packing of graphs (i.e., 2-uniform hypergraphs) has been studied extensively since seventies ...
Konarski Jerzy +2 more
doaj +1 more source