Results 1 to 10 of about 11,526 (190)
Tight Euler tours in uniform hypergraphs - computational aspects [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 By a tight tour in a $k$-uniform hypergraph $H$ we mean any sequence of its vertices $(w_0,w_1,\ldots,w_{s-1})$ such that for all $i=0,\ldots,s-1$ the set $e_i=\{w_i,w_{i+1}\ldots,w_{i+k-1}\}$ is an edge of $H$ (where operations on indices are computed ...
Zbigniew Lonc +2 more
doaj +3 more sources
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 +3 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
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
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
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
Anti-Ramsey Hypergraph Numbers
Electronic Journal of Graph Theory and Applications, 2021 The anti-Ramsey number arn(H) of an r-uniform hypergraph is the maximum number of colors that can be used to color the hyperedges of a complete r-uniform hypergraph on n vertices without producing a rainbow copy of H.
Mark Budden, William Stiles
doaj +1 more source
Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles [PDF]
Opuscula Mathematica, 2020 It is known that the 3-uniform loose 3-cycle decomposes the complete 3-uniform hypergraph of order \(v\) if and only if \(v \equiv 0, 1,\text{ or }2\ (\operatorname{mod} 9)\).
Ryan C. Bunge +5 more
doaj +1 more source
Decompositions of complete 3-uniform hypergraphs into cycles of constant prime length [PDF]
Opuscula Mathematica, 2020 A complete \(3\)-uniform hypergraph of order \(n\) has vertex set \(V\) with \(|V|=n\) and the set of all \(3\)-subsets of \(V\) as its edge set. A \(t\)-cycle in this hypergraph is \(v_1, e_1, v_2, e_2,\dots, v_t, e_t, v_1\) where \(v_1, v_2,\dots, v_t\)
R. Lakshmi, T. Poovaragavan
doaj +1 more source
-partite self-complementary and almost self-complementary -uniform hypergraphs
AKCE International Journal of Graphs and Combinatorics, 2020 A hypergraph is said to be -partite -uniform if its vertex set can be partitioned into non-empty sets so that every edge in the edge set , consists of precisely one vertex from each set , . It is denoted as or if for .
L.N. Kamble +2 more
doaj +1 more source