Results 11 to 20 of about 665 (142)
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 +2 more sources
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 +3 more sources
Self-complementary hypergraphs
, 2010 In this thesis, we survey the current research into self-complementary hypergraphs, and present several new results. We characterize the cycle type of the permutations on n elements with order equal to a power of 2 which are k-complementing. The k-complementing permutations map the edges of a k-uniform hypergraph to the edges of its complement.
Gosselin, Shonda
openaire +4 more sources
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
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
Multi-Modal Enhancement Transformer Network for Skeleton-Based Human Interaction Recognition [PDF]
BiomimeticsSkeleton-based human interaction recognition is a challenging task in the field of vision and image processing. Graph Convolutional Networks (GCNs) achieved remarkable performance by modeling the human skeleton as a topology.
Qianshuo Hu, Haijun Liu
doaj +2 more sources
Self-complementary hypergraphs
Discussiones Mathematicae Graph Theory, 2006 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;
A. Pawel Wojda, Wojda, A.
openaire +2 more sources
A note on k-uniform self-complementary hypergraphs of given order
Discussiones Mathematicae Graph Theory, 2009 We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if
Artur Szymanski, A. Pawel Wojda
openaire +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