Results 1 to 10 of about 1,981 (215)
A Note on Packing of Uniform Hypergraphs [PDF]
We say that two n-vertex hypergraphs H1 and H2 pack if they can be found as edge-disjoint subhypergraphs of the complete hypergraph Kn. Whilst the problem of packing of graphs (i.e., 2-uniform hypergraphs) has been studied extensively since seventies ...
Konarski Jerzy +2 more
doaj +5 more sources
Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence. [PDF]
Partite, 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
Fixation dynamics on hypergraphs. [PDF]
Hypergraphs have been a useful tool for analyzing population dynamics such as opinion formation and the public goods game occurring in overlapping groups of individuals.
Ruodan Liu, Naoki Masuda
doaj +2 more sources
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 +1 more source
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs [PDF]
We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n vertices. Those hypergraphs (and their minimal transversals) are commonly found in database applications.
Alexandre Bazin +3 more
doaj +1 more source
On the distance energy of k-uniform hypergraphs
In this article, we extend the concept of distance energy for hypergraphs. We first establish a relation between the distance energy and the distance spectral radius.
Sharma Kshitij, Panda Swarup Kumar
doaj +1 more source
Hypergraph partitioning using tensor eigenvalue decomposition.
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 +1 more source
On Clustering Detection Based on a Quadratic Program in Hypergraphs
A proper cluster is usually defined as maximally coherent groups from a set of objects using pairwise or more complicated similarities. In general hypergraphs, clustering problem refers to extraction of subhypergraphs with a higher internal density, for ...
Qingsong Tang
doaj +1 more source
ON THE SPECTRA OF TENSOR JOIN OF HYPERGRAPHS [PDF]
In this paper, we consider certain classes of hypergraphs constructed from the tensor join of hypergraphs, specifically the tensor join of hypergraphs constrained by vertex subsets and the $(H, \mathcal{T}_{\mathcal{S}})$-join of hypergraphs constrained ...
Vishnupriya Ramkumar, Rajkumar Rajendran
doaj +1 more source
A family of $t$-regular self-complementary $k$-hypergraphs [PDF]
We use the recursive method of construction large sets of t-designs given by Qiu-rong Wu (A note on extending t-designs, {em Australas. J. Combin.}, {bf 4} (1991) 229--235.), and present a similar method for constructing $t$-subset-regular self-
Masoud Ariannejad +2 more
doaj +1 more source

