A class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphs [PDF]
International Journal of Mathematics and Mathematical Sciences, 2005 In 1986, Johnson and Perry proved a class of inequalities for uniform hypergraphs which included the following: for any such hypergraph, the geometric mean over the hyperedges of the geometric means of the degrees of the nodes on the hyperedge is no less
P. D. Johnson, R. N. Mohapatra
doaj +2 more sources
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
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
Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles [PDF]
Opuscula Mathematica, 2019 We use the Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph. A decomposition of complete \(k\)-uniform hypergraph \(K^{(k)}_{n}\) into Hamiltonian cycles was studied by Bailey-Stevens and Meszka-Rosa. For \(n\equiv 2,4,5\pmod 6\)
Meihua, Meiling Guan, Jirimutu
doaj +2 more sources
The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph [PDF]
, 2013 In this paper, we show that the largest Laplacian H-eigenvalue of a $k$-uniform nontrivial hypergraph is strictly larger than the maximum degree when $k$ is even. A tight lower bound for this eigenvalue is given.
Hu, Shenglong, Qi, Liqun, Xie, Jinshan
core +3 more sources
Hypergraph partitioning using tensor eigenvalue decomposition. [PDF]
PLoS ONE, 2023 Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities.
Deepak Maurya, Balaraman Ravindran
doaj +2 more sources
The Evolution of Cooperation in Multigames with Uniform Random Hypergraphs
Mathematics, 2023 How to explain the emergence of cooperative behavior remains a significant problem. As players may hold diverse perceptions on a particular dilemma, the concept of multigames has been introduced.
Haozheng Xu +4 more
doaj +2 more sources
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
The Wiener index, degree distance index and Gutman index of composite hypergraphs and sunflower hypergraphs [PDF]
Heliyon, 2022 Topological invariants are numerical parameters of graphs or hypergraphs that indicate its topology and are known as graph or hypergraph invariants. In this paper, topological indices of hypergraphs such as Wiener index, degree distance index and Gutman ...
Sakina Ashraf +3 more
doaj +2 more sources
What must be contained in every oriented k-uniform hypergraph
Discrete Mathematics, 1986 Péter Frankl
openalex +2 more sources