Results 31 to 40 of about 728,495 (209)
A family of $t$-regular self-complementary $k$-hypergraphs [PDF]
Transactions on Combinatorics, 2017 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
Hypergraph partitioning using tensor eigenvalue decomposition.
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 +1 more source
Uniform hypergraphs containing no grids [PDF]
, 2013 A hypergraph is called an r×r grid if it is isomorphic to a pattern of r horizontal and r vertical lines, i.e.,a family of sets {A1, ..., Ar, B1, ..., Br} such that Ai∩Aj=Bi∩Bj=φ for 1 ...
Füredi, Zoltán, Ruszinkó, Miklós
core +1 more source
On Laplacian Energy of r-Uniform Hypergraphs
, 2023 The matrix representations of hypergraphs have been defined via hypermatrices initially. In recent studies, the Laplacian matrix of hypergraphs, a generalization of the Laplacian matrix, has been introduced.
N. Feyza Yalçın
core +1 more source
ON THE SPECTRA OF TENSOR JOIN OF HYPERGRAPHS [PDF]
Journal of Algebraic SystemsIn 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
On Clustering Detection Based on a Quadratic Program in Hypergraphs
Journal of Mathematics, 2022 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
Spectra of uniform hypergraphs
Linear Algebra and its Applications, 2012 We present a spectral theory of hypergraphs that closely parallels Spectral Graph Theory. A number of recent developments building upon classical work has led to a rich understanding of "hyperdeterminants" of hypermatrices, a.k.a. multidimensional arrays.
Cooper, Joshua, Dutle, Aaron
openaire +3 more sources
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
, 2013 This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +1 more source
Transversals in regular uniform hypergraphs
Journal of Graph Theory, 2023 AbstractThe transversal number of a hypergraph is the minimum number of vertices that intersect every edge of . This notion of transversal is fundamental in hypergraph theory and has been studied a great deal in the literature. A hypergraph is ‐regular if every vertex of has degree , that is, every vertex of belongs to exactly edges. Further, is
Michael A. Henning, Anders Yeo
openaire +3 more sources
High Girth Hypergraphs with Unavoidable Monochromatic or Rainbow Edges
Discussiones Mathematicae Graph Theory, 2022 A classical result of Erdős and Hajnal claims that for any integers k, r, g ≥ 2 there is an r-uniform hypergraph of girth at least g with chromatic number at least k.
Axenovich Maria, Karrer Annette
doaj +1 more source