Results 11 to 20 of about 409 (109)
Self-complementary hypergraphs and their self-complementing permutations
Electronic Notes in Discrete Mathematics, 2006 Abstract A k –uniform hypergraph H = ( V ; E ) is called self-complementary if there is a permutation σ : V → V , called self-complementing , such that for every k –subset e of V , e ∈ E if and only if σ ( e ) ∉ E . In other words, H is isomorphic with H ′ = ( V ; ( V k ) −
Artur Szymanski, A. Pawel Wojda
exaly +2 more sources
A note on self-complementary 4-uniform hypergraphs [PDF]
Opuscula Mathematica, 2005 We prove that a permutation \(\theta\) is complementing permutation for a \(4\)-uniform hypergraph if and only if one of the following cases is satisfied: (i) the length of every cycle of \(\theta\) is a multiple of \(8\), (ii) \(\theta\) has \(1\), \(2\)
Artur Szymański
doaj +1 more source
Vertex-transitive self-complementary uniform hypergraphs of prime order
Discrete Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shonda Gosselin
exaly +3 more sources
SPLHRNMTF: robust orthogonal non-negative matrix tri-factorization with self-paced learning and dual hypergraph regularization for predicting miRNA-disease associations [PDF]
BMC GenomicsMicroRNAs (miRNAs) have been demonstrated to be closely related to human diseases. Studying the potential associations between miRNAs and diseases contributes to our understanding of disease pathogenic mechanisms.
Dong Ouyang +7 more
doaj +2 more sources
Cyclic Partitions of Complete and Almost Complete Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2022 We consider cyclic partitions of the complete k-uniform hypergraph on a finite set V, minus a set of s edges, s ≥ 0. An s-almost t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation ...
Dilbarjot, Gosselin Shonda Dueck
doaj +1 more source
Vertex-transitive self-complementary uniform hypergraphs
European Journal of Combinatorics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Primoz Potocnik, Mateja Sajna
openaire +2 more sources
A family of \(t\)-regular self-complementary \(k\)-hypergraphs
Transactions on Combinatorics, 2017 Summary: We use the recursive method of construction large sets of \(t\)-designs given by \textit{Q.-r. Wu} [Australas. J. Comb. 4, 229--235 (1991; Zbl 0763.05013)], and present a similar method for constructing \(t\)-subset-regular self-complementary \(k\)-uniform hypergraphs of order \(v\). As an application we show the existence of a new family of 2-
Ariannejad, Masoud +2 more
openaire +2 more sources
A note on 2-subset-regular self-complementary 3-uniform hypergraphs
Ars Comb., 2008 We show that a 2-subset-regular self-complementary 3-uniform hypergraph with $n$ vertices exists if and only if $n\ge 6$ and $n$ is congruent to 2 modulo 4.
Martin Knor, Primoz Potocnik
openaire +2 more sources
Topology‐Aware Deep Learning on Higher‐Order Structures for Drug Response Prediction
Advanced Science, EarlyView.We present TopDr, a topology‐aware deep learning framework that encodes both drugs and cell lines as multiscale simplicial complexes, capturing interactions at the 0‐, 1‐, and 2‐simplex levels. By jointly integrating local higher‐order neighborhoods and global topological structures, TopDr generates enriched representations for sensitivity prediction ...
Cong Shen +3 more
wiley +1 more source
Land Degradation &Development, EarlyView.ABSTRACT The use of Land Use Land Cover (LULC) analysis is a fundamental requirement for urban solid waste management (SWM); however, conventional LULC analysis methods are not well suited to the spatio‐temporal variability, multi‐sensor heterogeneity, and seasonal variations of highly dynamic urban environments.
Rubeena Vohra, Ashish Kumar
wiley +1 more source