Results 21 to 30 of about 728,495 (209)
Quantum walks on regular uniform hypergraphs. [PDF]
Sci Rep, 2018 Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information stored ...
Liu Y, Yuan J, Duan B, Li D.
europepmc +2 more sources
Prime 3-Uniform Hypergraphs [PDF]
Graphs and Combinatorics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abderrahim Boussaïri +3 more
openaire +1 more source
Clique-symmetric uniform hypergraphs [PDF]
, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
McSorley, John P, Porter, Thomas
openaire +2 more sources
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 +1 more source
On the irregularity of uniform hypergraphs [PDF]
European Journal of Combinatorics, 2018 14 ...
Lele Liu, Liying Kang, Erfang Shan
openaire +2 more sources
Equitable orientations of sparse uniform hypergraphs
, 2016 International audienceCaro, West, and Yuster studied how r-uniform hypergraphs can be oriented in such a way that (generalizations of) indegree and outdegree are as close to each other as can be hoped.
Lochet, William, Cohen, Nathann
core +7 more sources
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 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
Special Matrices, 2023 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
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 +4 more sources
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 +6 more sources