Results 101 to 110 of about 11,124 (213)
Physical Review EHere we introduce simple structures for the analysis of complex hypergraphs, hypergraph animals. These structures are designed to describe the local node neighbourhoods of nodes in hypergraphs. We establish their relationships to lattice animals and network motifs, and we develop their combinatorial properties for sparse and uncorrelated hypergraphs ...
openaire +3 more sources
Discrete Mathematics, 1985 Threshold graphs were introduced by \textit{V. Chvátal} and \textit{P. L. Hammer} [Ann. Discrete Math. 1, 145-162 (1977; Zbl 0384.90091)]. They gave three equivalent characterizations of these graphs. These characterizations were generalized for hypergraphs by \textit{M. Ch. Golumbic} [Combinatorics, Keszthely 1976, Colloq. Math.
Jan Reiterman +3 more
openaire +1 more source
Finding the K shortest hyperpaths using reoptimization [PDF]
The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen ...
Andersen, Kim Allan +2 more
core
The upper chromatic number of quasi-interval co-hypergraphs
Le Matematiche, 1997 We investigate the structural and colouring properties of clique hyper-graphs of interval graphs called the quasi-interval hypergraphs. We find the conditions when they are interval hypergraphs. The upper chromatic number for the clique co-hypergraphs of
Violeta Prisakaru
doaj
Modularity Definition and Optimization Algorithm for Community Detection in Signed Hypergraphs
ComplexityThe analysis of super-dyadic relations through hypergraphs is gradually gaining attention, with its community structure analysis playing a crucial role in computational social science.
Wei Du, Guangyu Li
doaj +1 more source
Analysis of hub parameters in fuzzy hypergraphs extending to intuitionistic fuzzy threshold hypergraphs: Applications in designing transport networks in amusement parks using hub hyperpaths [PDF]
Notes on IFSA hypergraph is a generalization of a graph where an edge can connect any number of vertices. In this paper, many different aspects of fuzzy hypergraphs and their applications are examined.
K. K. Myithili, C. Nandhini
doaj +1 more source
, 2018 In this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by its weak edge connectivity, thereby extending a theorem of Whitney from ...
Megan Dewar, David Pike, John Proos
core +1 more source
Influence Maximization in Hypergraphs [PDF]
, 2022 Influence maximization in complex networks, i.e., maximizing the size of influenced nodes via selecting K seed nodes for a given spreading process, has attracted great attention in recent years. However, the influence maximization problem in hypergraphs,
Zhang, Zi-Ke +3 more
core +1 more source
Census and Analysis of Higher-Order Interactions in Real-World Hypergraphs
Big Data Mining and AnalyticsComplex systems can be more accurately described by higher-order interactions among multiple units. Hypergraphs excel at depicting these interactions, surpassing the binary limitations of traditional graphs.
Xihang Meng +4 more
doaj +1 more source
The subdivision of hypergraphs
, 2023 Hypergraphs, as a generalization of simplicial complexes, have long been a subject of interest in their geometric interpretation. The subdivision of simplicial complexes can, to some extent, provide insights into the geometry of simplicial complexes.
Wu, Jie, Liu, Jian, Liu, Ran
core