Results 11 to 20 of about 1,548 (146)
Link Prediction with Hypergraphs via Network Embedding
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
Concentric Plithogenic Hypergraph based on Plithogenic Hypersoft sets – A Novel Outlook [PDF]
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
Generalized Hypergraph Coloring
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
Regular Single Valued Neutrosophic Hypergraphs [PDF]
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
Signaling pathways function as the information-passing mechanisms of cells. A number of databases with extensive manual curation represent the current knowledge base for signaling pathways. These databases motivate the development of computational approaches for prediction and analysis.
Anna, Ritz +4 more
openaire +2 more sources
Nonintersecting Ryser Hypergraphs [PDF]
8 pages, some corrections in the proof of Lemma 3.6, added more explanation in the appendix, and other minor ...
Bishnoi A., Pepe V.
openaire +2 more sources
The notion of pattern hypergraph provides a unified view of several previously studied coloring concepts. A pattern hypergraph $H$ is a hypergraph where each edge is assigned a type $\Pi_i$ that determines which of possible colorings of the edge are proper. A vertex coloring of $H$ is proper if it is proper for every edge.
Dvořák, Zdeněk +3 more
openaire +2 more sources
Oriented hypergraphs: Balanceability
An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic
Lucas J. Rusnak +4 more
openaire +2 more sources
Regular Bipolar Single Valued Neutrosophic Hypergraphs [PDF]
In this paper, we define the regular and totally regular bipolar single valued neutrosophic hypergraphs, and discuss the order and size along with properties of regular and totally regular bipolar single valued neutrosophic hypergraphs. We extend work on
Muhammad Aslam Malik +3 more
doaj +1 more source
Elementary definability of the class of universal hypergraphic automata in the class of semigroups [PDF]
Hypergraphic automata are automata, state sets and output symbol sets of which are hypergraphs, being invariant under actions of transition and output functions. Universally attracting objects in the category of hypergraphic automata are called universal
Molchanov, Vladimir Aleksandrovich +1 more
doaj +1 more source

