Results 1 to 10 of about 602 (144)
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 +2 more sources
Almost Self-Complementary 3-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2017 It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is congruent to 0, 1 or 2 modulo 4. In this paper we define an almost self-complementary 3-uniform hypergraph on n vertices and prove that it exists if and ...
Kamble Lata N. +2 more
doaj +3 more sources
Edge Balanced 3-Uniform Hypergraph Designs
Mathematics, 2020 In this paper, we completely determine the spectrum of edge balanced H-designs, where H is a 3-uniform hypergraph with 2 or 3 edges, such that H has strong chromatic number χs(H)=3.
Paola Bonacini +2 more
doaj +2 more sources
The existence of bipartite almost self-complementary 3-uniform hypergraphs [PDF]
Opuscula Mathematica, 2023 An almost self-complementary 3-uniform hypergraph on \(n\) vertices exists if and only if \(n\) is congruent to 3 modulo 4 A hypergraph \(H\) with vertex set \(V\) and edge set \(E\) is called bipartite if \(V\) can be partitioned into two subsets \(V_1\
L.N. Kamble +2 more
doaj +1 more source
Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence. [PDF]
PLoS ONEPartite, 3-uniform hypergraphs are 3-uniform hypergraphs in which each hyperedge contains exactly one point from each of the 3 disjoint vertex classes. We consider the degree sequence problem of partite, 3-uniform hypergraphs, that is, to decide if such ...
András Hubai +4 more
doaj +2 more sources
Prime 3-Uniform Hypergraphs [PDF]
Graphs and Combinatorics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abderrahim Boussaïri +3 more
openaire +1 more source
Super edge-magic labeling for 𝒌-uniform, complete 𝒌-uniform and complete 𝒌-uniform 𝒌-partite hypergraphs [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2021 Let 𝐻 be a hypergraph with a vertex set 𝑉 and a hyperedge set 𝐸. Generalized from the super edge-magic in a graph, we say that a hypergraph 𝐻 is super edge-magic if there is a bijection 𝑓: 𝑉 ∪ 𝐸 → {1,2,3, … , |𝑉| + |𝐸|} which satisfies: (i) there exists
Ratinan Boonklurb +2 more
doaj +1 more source
A hyperedge coloring and application in combinatorial testing
AKCE International Journal of Graphs and Combinatorics, 2022 For a hypergraph H, a uniform k-coloring of hyperedges always has the same (to within 1) number of hyperedges of each color, whereas an equitable k-coloring of hyperedges has the property that at every vertex all the colors incident the same number of ...
Yasmeen Akhtar
doaj +1 more source
Subdivision of hypergraphs and their colorings [PDF]
Opuscula Mathematica, 2020 In this paper we introduce the subdivision of hypergraphs, study their properties and parameters and investigate their weak and strong chromatic numbers in various cases.
Moharram N. Iradmusa
doaj +1 more source
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