Results 131 to 140 of about 5,018,820 (150)
The existence of regular self-complementary 3-uniform hypergraphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Primoz Potocnik, Mateja Sajna
exaly +4 more sources
Constructing regular self-complementary uniform hypergraphs [PDF]
Journal of Combinatorial Designs, 2011 Summary: We examine the possible orders of t-subset-regular self-complementary \(k\)-uniform hypergraphs, which form examples of large sets of two isomorphic \(t\)-designs. We reformulate Khosrovshahi and Tayfeh -- Rezaie's necessary conditions on the order of these structures in terms of the binary representation of the rank \(k\), and these ...
Shonda Gosselin
exaly +3 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
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 +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Some Infinite Families of t-Regular Self-complementary k-Hypergraphs
Bulletin of the Iranian Mathematical Society, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emami, M., Naserian, O.
openaire +1 more source
Journal of Combinatorial Mathematics and Combinatorial Computing
<p>A hypergraph <span class="math inline">\(H\)</span> is said to be <span class="math inline">\(r\)</span>-partite <span class="math inline">\(r\)</span>-uniform if its vertex set <span class="math inline">\(V\)</span> can be partitioned into non-empty sets <span class="math inline">\(V_1 ...
Lata Kadam +3 more
openaire +1 more source
<p>A hypergraph <span class="math inline">\(H\)</span> is said to be <span class="math inline">\(r\)</span>-partite <span class="math inline">\(r\)</span>-uniform if its vertex set <span class="math inline">\(V\)</span> can be partitioned into non-empty sets <span class="math inline">\(V_1 ...
Lata Kadam +3 more
openaire +1 more source
Reconstructing graphs as subsumed graphs of hypergraphs, and some self-complementary triple systems
Graphs and Combinatorics, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Some New Families of 3-Regular Self-complementary k-Hypergraphs
Bulletin of the Iranian Mathematical Society, 2021Mojgan Emami
exaly
A Self-paced Learning based Transfer Model for Hypergraph Matching
Information Sciences, 2022Guoxia Xu, Lizhen Deng, Hu Zhu
exaly