Results 21 to 30 of about 25,758 (195)
Nonintersecting Ryser Hypergraphs [PDF]
SIAM Journal on Discrete Mathematics, 2020 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
Cognitive Networks for Knowledge Modeling: A Gentle Introduction for Data- and Cognitive Scientists. [PDF]
Wiley Interdiscip Rev Cogn SciCognitive network science helps organize associative knowledge—that is, the connections between concepts. These connections play a key role in cognitive processes such as language understanding and context interpretation, even though they are not obvious in language use.
Haim E, Stella M.
europepmc +2 more sources
The Electronic Journal of Combinatorics, 2010 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
Discrete Mathematics, 2022 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]
Neutrosophic Sets and Systems, 2016 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]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2022 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
Physical Review E, 2023 Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce complex hypergraphs (chygraphs), bringing together concepts from hypergraphs, multi-layer networks, simplicial ...
openaire +3 more sources
Hypergraphs in m-Polar Fuzzy Environment
Mathematics, 2018 Fuzzy graph theory is a conceptual framework to study and analyze the units that are intensely or frequently connected in a network. It is used to study the mathematical structures of pairwise relations among objects. An m-polar fuzzy (mF, for short) set
Muhammad Akram, Gulfam Shahzadi
doaj +1 more source
Random Structures & Algorithms, 2012 AbstractThis paper is motivated by the question of how global and dense restriction sets in results from extremal combinatorics can be replaced by less global and sparser ones. The result we consider here as an example is Turán's theorem, which deals with graphs G = ([n],E) such that no member of the restriction set \documentclass{article} \usepackage ...
Allen, Peter +3 more
openaire +3 more sources
Coloring d-Embeddable k-Uniform Hypergraphs [PDF]
, 2014 This paper extends the scenario of the Four Color Theorem in the following way. Let H(d,k) be the set of all k-uniform hypergraphs that can be (linearly) embedded into R^d.
Heise, Carl Georg +3 more
core +1 more source