Results 11 to 20 of about 11,596 (195)
On the irregularity of uniform hypergraphs [PDF]
European Journal of Combinatorics, 2018 14 ...
Lele Liu, Liying Kang, Erfang Shan
openaire +2 more sources
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
A Cheeger Cut for Uniform Hypergraphs [PDF]
Graphs and Combinatorics, 2021 AbstractThe graph Cheeger constant and Cheeger inequalities are generalized to the case of hypergraphs whose edges have the same cardinality. In particular, it is shown that the second largest eigenvalue of the generalized normalized Laplacian is bounded both above and below by the generalized Cheeger constant, and the corresponding eigenfunctions can ...
openaire +5 more sources
Tensor Entropy for Uniform Hypergraphs [PDF]
IEEE Transactions on Network Science and Engineering, 2020 In this paper, we develop the notion of entropy for uniform hypergraphs via tensor theory. We employ the probability distribution of the generalized singular values, calculated from the higher-order singular value decomposition of the Laplacian tensors, to fit into the Shannon entropy formula.
Can Chen 0003, Indika Rajapakse
openaire +2 more sources
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
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
A note on packing of uniform hypergraphs
Discussiones Mathematicae Graph Theory, 2021 A packing of two $k$-uniform hypergraphs $H_1$ and $H_2$ is a set $\{H_1', H_2'\}$ of edge-disjoint sub-hypergraphs of the complete $k$-uniform hypergraph $K_n^{(k)}$ such that $H_1'\cong H_1$ and $H_2'\cong H_2$. Whilst the problem of packing of graphs (i.e.
Jerzy Konarski +2 more
openaire +4 more sources
On Lagrangians of r-uniform hypergraphs [PDF]
Journal of Combinatorial Optimization, 2013 A remarkable connection between the order of a maximum clique and the Lagrangian of a graph was established by Motzkin and Straus in [7]. This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum clique number in graphs. It has been also applied in spectral graph theory.
Yuejian Peng +2 more
openaire +3 more sources
-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
On the Sizes of (k, l)-Edge-Maximal r-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2023 Let H = (V, E) be a hypergraph, where V is a set of vertices and E is a set of non-empty subsets of V called edges. If all edges of H have the same cardinality r, then H is an r-uniform hypergraph; if E consists of all r-subsets of V, then H is a ...
Tian Yingzhi +3 more
doaj +1 more source