Results 31 to 40 of about 41,298 (230)
Quasi‐random hypergraphs [PDF]
Random Structures & Algorithms, 1989 AbstractWe introduce an equivalence class of varied properties for hypergraphs. Any hypergraph possessing any one of these properties must of necessity possess them all. Since almost all random hypergraphs share these properties, we term these properties quasi‐random.
Chung, F. R. K., Graham, R. L.
openaire +3 more sources
Optimal Query Complexity for Reconstructing Hypergraphs [PDF]
, 2010 In this paper we consider the problem of reconstructing a hidden weighted hypergraph of constant rank using additive queries. We prove the following: Let $G$ be a weighted hidden hypergraph of constant rank with n vertices and $m$ hyperedges. For any $m$
Bshouty, Nader H., Mazzawi, Hanna
core +6 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
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
On edge-sets of bicliques in graphs [PDF]
, 2012 A biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the associated edge-biclique hypergraph whose hyperedges are precisely the edge-
Groshaus, Marina +2 more
core +2 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
Hypernetwork science via high-order hypergraph walks
EPJ Data Science, 2020 We propose high-order hypergraph walks as a framework to generalize graph-based network science techniques to hypergraphs. Edge incidence in hypergraphs is quantitative, yielding hypergraph walks with both length and width.
Sinan G. Aksoy +4 more
doaj +1 more source
Toric algebra of hypergraphs [PDF]
, 2013 The edges of any hypergraph parametrize a monomial algebra called the edge subring of the hypergraph. We study presentation ideals of these edge subrings, and describe their generators in terms of balanced walks on hypergraphs.
Petrović, Sonja, Stasi, Despina
core +1 more source
, 2011 Hypergraphs are generalization of graphs where each edge (hyperedge) can connect more than two vertices. In simple terms, the hypergraph partitioning problem can be defined as the task of dividing the vertices of hypergraph into two or more roughly equal sized parts such that a cost function on the hyperedges connecting vertices in different parts is ...
Quincey Koziol +13 more
openaire +3 more sources
Journal of Pure and Applied Algebra, 2019 38 ...
Fong, Brendan, Spivak, David I.
openaire +4 more sources