Results 111 to 120 of about 56,309 (276)
Directed hypergraph attention network for traffic forecasting
IET Intelligent Transport Systems, 2022 In traffic systems, traffic forecasting is a critical issue, which has attracted much interest from researchers. It is a challenging task due to the complex spatial‐temporal patterns of traffic data.
Xiaoyi Luo, Jiaheng Peng, Jun Liang
doaj +1 more source
Graph Entropy Based on Strong Coloring of Uniform Hypergraphs
Axioms, 2021 The classical graph entropy based on the vertex coloring proposed by Mowshowitz depends on a graph. In fact, a hypergraph, as a generalization of a graph, can express complex and high-order relations such that it is often used to model complex systems ...
Lusheng Fang +3 more
doaj +1 more source
Multipartite Entanglement and Hypergraph states of three qubits
, 2013 Several entanglement measures are used to define equivalence classes in the set of hypergraph states of three qubits. Our classifications reveal that (i) under local unitary transformations, hypergraph states of three qubits are split into six classes ...
Bao, Yan-ru +3 more
core +1 more source
Coloured shuffle compatibility, Hadamard products, and ask zeta functions
Bulletin of the London Mathematical Society, EarlyView.Abstract We devise an explicit method for computing combinatorial formulae for Hadamard products of certain rational generating functions. The latter arise naturally when studying so‐called ask zeta functions of direct sums of modules of matrices or class‐ and orbit‐counting zeta functions of direct products of nilpotent groups.
Angela Carnevale +2 more
wiley +1 more source
On Planar Supports for Hypergraphs [PDF]
Journal of Graph Algorithms and Applications, 2010 A graph G is a support for a hypergraph H=(V,S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si e S the subgraph of G induced by Si is connected. G is a planar support if it is a support and planar. Johnson and Pollak [9] proved that it is NP-complete to decide if a given hypergraph has a planar support. In contrast,
Kevin Verbeek +4 more
openaire +8 more sources
Neighborhood hypergraph model for topological data analysis
Computational and Mathematical Biophysics, 2022 Hypergraph, as a generalization of the notions of graph and simplicial complex, has gained a lot of attention in many fields. It is a relatively new mathematical model to describe the high-dimensional structure and geometric shapes of data sets.
Liu Jian, Chen Dong, Li Jingyan, Wu Jie
doaj +1 more source
Journal of Combinatorial Designs, Volume 33, Issue 8, Page 300-309, August 2025.ABSTRACT We investigate the lazy burning process for Latin squares by studying their associated hypergraphs. In lazy burning, a set of vertices in a hypergraph is initially burned, and that burning spreads to neighboring vertices over time via a specified propagation rule.
Anthony Bonato +3 more
wiley +1 more source
The k-annihilating-ideal hypergraph of commutative ring
AKCE International Journal of Graphs and Combinatorics, 2019 The concept of the annihilating-ideal graph of a commutative ring was introduced by Behboodi et. al in 2011. In this paper, we extend this concept to the hypergraph for which we define an algebraic structure called k-annihilating-ideal of a commutative ...
K. Selvakumar, V. Ramanathan
doaj
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 +1 more source
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