Results 1 to 10 of about 56,162 (272)
Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges
In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs ...
Fan Yi-Zheng +3 more
doaj +2 more sources
Cartesian product of hypergraphs: properties and algorithms [PDF]
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product.
Alain Bretto +2 more
doaj +6 more sources
On structures in hypergraphs of models of a theory [PDF]
Hypergraphs of models of a theory are derived objects allowing toobtain an essential structural information about both giventheories and related semantic objects including graph ones.
B.Sh. Kulpeshov, S.V. Sudoplatov
doaj +4 more sources
Hypergraph Learning with Line Expansion [PDF]
Previous hypergraph expansions are solely carried out on either vertex level or hyperedge level, thereby missing the symmetric nature of data co-occurrence, and resulting in information loss.
Abdelzaher, Tarek +3 more
core +1 more source
Quantum Contextual Hypergraphs, Operators, Inequalities, and Applications in Higher Dimensions [PDF]
Quantum contextuality plays a significant role in supporting quantum computation and quantum information theory. The key tools for this are the Kochen–Specker and non-Kochen–Specker contextual sets.
Mladen Pavičić
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
Hypergraph and Uncertain Hypergraph Representation Learning Theory and Methods
With the advent of big data and the information age, the data magnitude of various complex networks is growing rapidly. Many real-life situations cannot be portrayed by ordinary networks, while hypergraphs have the ability to describe and characterize ...
Liyan Zhang +5 more
doaj +1 more source
Sharp Bounds on the Spectral Radii of Uniform Hypergraphs concerning Diameter or Clique Number
In this paper, we defined two classes of hypergraphs, hyperbugs and kite hypergraphs. We show that balanced hyperbugs maximize the spectral radii of hypergraphs with fixed number of vertices and diameter and kite hypergraphs minimize the spectral radii ...
Qiannan Niu, Haizhen Ren, Lei Zhang
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
Generalized Hypergraph Coloring
A smooth hypergraph property 𝒫 is a class of hypergraphs that is hereditary and non-trivial, i.e., closed under induced subhypergraphs and it contains a non-empty hypergraph but not all hypergraphs.
Schweser Thomas
doaj +1 more source

