Results 11 to 20 of about 8,099 (222)
Hypergraph Based Berge Hypergraphs [PDF]
Graphs and Combinatorics, 2021 Fix a hypergraph $\mathcal{F}$. A hypergraph $\mathcal{H}$ is called a {\it Berge copy of $\mathcal{F}$} or {\it Berge-$\mathcal{F}$} if we can choose a subset of each hyperedge of $\mathcal{H}$ to obtain a copy of $\mathcal{F}$. A hypergraph $\mathcal{H}$ is {\it Berge-$\mathcal{F}$-free} if it does not contain a subhypergraph which is Berge copy of $\
Martin Balko +4 more
openaire +3 more sources
Hypergraph and Uncertain Hypergraph Representation Learning Theory and Methods
Mathematics, 2022 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
Journal of Combinatorial Theory, Series B, 2021 The following very natural problem was raised by Chung and Erdős in the early 80's and has since been repeated a number of times. What is the minimum of the Turán number $\text{ex}(n,\mathcal{H})$ among all $r$-graphs $\mathcal{H}$ with a fixed number of edges?
Matija Bucic +3 more
openaire +4 more sources
Sharp Bounds on the Spectral Radii of Uniform Hypergraphs concerning Diameter or Clique Number
Discrete Dynamics in Nature and Society, 2021 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
Journal of Mathematics, 2022 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
Quasirandomness in hypergraphs [PDF]
Electronic Notes in Discrete Mathematics, 2017 An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical' properties are asymptotically equivalent and, thus, a graph $G$ possessing one such property automatically satisfies the ...
Elad Aigner-Horev +4 more
openaire +5 more sources
Link Prediction with Hypergraphs via Network Embedding
Applied Sciences, 2022 Network embedding is a promising field and is important for various network analysis tasks, such as link prediction, node classification, community detection and others.
Zijuan Zhao, Kai Yang, Jinli Guo
doaj +1 more source
Generalized Hypergraph Coloring
Discussiones Mathematicae Graph Theory, 2021 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
Concentric Plithogenic Hypergraph based on Plithogenic Hypersoft sets – A Novel Outlook [PDF]
Neutrosophic Sets and Systems, 2020 Plithogenic Hypersoft sets (PHS) introduced by Smarandache are the extensions of soft sets and hypersoft sets and it was further protracted to plithogenic fuzzy whole Hypersoft set to make it more applicable to multi attribute decision making ...
Nivetha Martin , Florentin Smarandache
doaj +1 more source
Regular Single Valued Neutrosophic Hypergraphs [PDF]
Neutrosophic Sets and Systems, 2016 In this paper, we define the regular and totally regular single valued neutrosophic hypergraphs, and discuss the order and size along with properties of regular and totally regular single valued neutrosophic hypergraphs.
Muhammad Aslam Malik +3 more
doaj +1 more source