Results 51 to 60 of about 1,548 (146)
Hypergraph Representation via Axis-Aligned Point-Subspace Cover [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe propose a new representation of $k$-partite, $k$-uniform hypergraphs, that is, a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly one vertex of each type; we call them $k$-hypergraphs for short.
Oksana Firman, Joachim Spoerhase
doaj +1 more source
Study on the reliability of hypergraphs based on non-backtracking matrix centrality
网络与信息安全学报In recent years, there has been widespread attention on hypergraphs as a research hotspot in network science.The unique structure of hypergraphs, which differs from traditional graphs, is characterized by hyperedges that can connect multiple nodes ...
Hao PENG, Cheng QIAN, Dandan ZHAO, Ming ZHONG, Jianmin HAN, Ziyi XIE, Wei WANG
doaj +3 more sources
Recursion Relations for Chromatic Coefficients for Graphs and Hypergraphs
Discussiones Mathematicae Graph Theory, 2022 We establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application we provide a generalization of Whitney’s broken cycle theorem for hypergraphs, as well as deriving an explicit ...
Durhuus Bergfinnur, Lucia Angelo
doaj +1 more source
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
On the separability of elements and sets in hypergraphs of models of a theory
Қарағанды университетінің хабаршысы. Математика сериясы, 2016 We consider topological properties of hypergraphs of models of a theory. The separability of elements in these hypergraphs is characterized in terms of algebraic closures. Similarly we specify the separability of sets by the hypergraphs.
S.V. Sudoplatov
doaj
, 2021 In this paper, we prove that for any $k\ge 3$, there exist infinitely many minimal asymmetric $k$-uniform hypergraphs. This is in a striking contrast to $k=2$, where it has been proved recently that there are exactly $18$ minimal asymmetric graphs. We also determine, for every $k\ge 1$, the minimum size of an asymmetric $k$-uniform hypergraph.
Jiang, Yiting, Nešetřil, Jaroslav
openaire +2 more sources
q-Rung Orthopair Fuzzy Hypergraphs with Applications
Mathematics, 2019 The concept of q-rung orthopair fuzzy sets generalizes the notions of intuitionistic fuzzy sets and Pythagorean fuzzy sets to describe complicated uncertain information more effectively.
Anam Luqman +2 more
doaj +1 more source
Colorful Subhypergraphs in Kneser Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2014 Using a $\mathbb{Z}_q$-generalization of a theorem of Ky Fan, we extend to Kneser hypergraphs a theorem of Simonyi and Tardos that ensures the existence of multicolored complete bipartite graphs in any proper coloring of a Kneser graph. It allows to derive a lower bound for the local chromatic number of Kneser hypergraphs (using a natural definition of
openaire +3 more sources
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