Results 31 to 40 of about 14,067 (220)
Even order uniform hypergraph via the Einstein product
AKCE International Journal of Graphs and Combinatorics, 2023 We propose the algebraic connectivity of an undirected 2m-uniform hypergraph under the Einstein product. We generalize the algebraic connectivity to a directed 2m-uniform hypergraph and reveal the relationship between the vertex connectivity and the ...
Jiaqi Gu, Yimin Wei
doaj +1 more source
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 +3 more sources
Algebraic structures and lattice properties of hypergraph Pre-Rough sets [PDF]
Mathematics and Computational SciencesThe study introduces and examines the concept of hypergraph pre-rough sets, which are developed by combining minimum soft descriptions with hypergraph structures.
Ganesan Gomathi +3 more
doaj +1 more source
The Electronic Journal of Combinatorics, 2016 A hypergraph $H$ is called universal for a family $\mathcal{F}$ of hypergraphs, if it contains every hypergraph $F \in \mathcal{F}$ as a copy. For the family of $r$-uniform hypergraphs with maximum vertex degree bounded by $\Delta$ and at most $n$ vertices any universal hypergraph has to contain $\Omega(n^{r-r/\Delta})$ many edges.
Samuel Hetterich +2 more
openaire +4 more sources
Almost Self-Complementary Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2018 A k-uniform hypergraph (k-hypergraph) is almost self-complementary if it is isomorphic with its complement in the complete k-uniform hypergraph minus one edge. We prove that an almost self-complementary k-hypergraph of order n exists if and only if (nk)$\
Wojda Adam Paweł
doaj +1 more source
IEEE Access, 2023 With the increasingly competitive job market, the employment issue for college graduates has received more and more attention. Predicting graduation development can help students understand their suitable graduation development, thus easing the pressure ...
Yong Ouyang +4 more
doaj +1 more source
, 2021 The continuous emergence of drug-target interaction data provides an opportunity to construct a biological network for systematically discovering unknown interactions.
Yan, C +8 more
core +1 more source
Semi-supervised Hypergraph Node Classification on Hypergraph Line Expansion [PDF]
, 2023 Previous hypergraph expansions are solely carried out on either vertex level or hyperedge level, thereby missing the symmetric nature of data co-occurrence, and resulting in information loss.
Yao, Shuochao +3 more
core +1 more source
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 ...
openaire +3 more sources
Individual Differences in Dynamic Functional Brain Connectivity across the Human Lifespan. [PDF]
PLoS Computational Biology, 2016 Individual differences in brain functional networks may be related to complex personal identifiers, including health, age, and ability. Dynamic network theory has been used to identify properties of dynamic brain function from fMRI data, but the majority
Elizabeth N Davison +6 more
doaj +1 more source