Results 51 to 60 of about 28,427 (196)
Countable connected-homogeneous digraphs [PDF]
, 2013 A digraph is connected-homogeneous if every isomorphism between two finite connected induced subdigraphs extends to an automorphism of the whole digraph.
Hamann, Matthias
core
Every countable model of set theory embeds into its own constructible universe
, 2014 The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe.
Aczel P. +3 more
core +2 more sources
Deep Dark Futures: Foresighting Human Impacts on Mesopelagic Ecosystem Services
Fish and Fisheries, EarlyView.This study uses foresighting to explore four plausible future scenarios of human activity affecting mesopelagic ecosystem services; provisioning, regulating, supporting and cultural. Using participatory scenario development, qualitative network modelling and indicator design, we assess systemic risks and early warning signals linked to harvest, climate
Ben Scoulding +18 more
wiley +1 more source
Ratio Mathematica, 2022 A Digraph D consists of two finite sets ), where denotes the vertex set and denotes the arc set. For vertices if there exists a directed path from to then is said to be reachable from and vice versa.
V Mahalakshmi, B Vijaya Praba, K Palani
doaj +1 more source
Laplacian matrices of weighted digraphs represented as quantum states
, 2017 Representing graphs as quantum states is becoming an increasingly important approach to study entanglement of mixed states, alternate to the standard linear algebraic density matrix-based approach of study.
Adhikari, Bibhas +3 more
core +1 more source
Word Associations in a Minoritised Language: The Case of Cymraeg (Welsh)
International Journal of Applied Linguistics, EarlyView.ABSTRACT As with many research strands in linguistics, word association (WA) literature is dominated by English language data. This paper (i) explores the extent to which methodologies developed to date are applicable to other languages—specifically, Welsh (Cymraeg)—and (ii) investigates what WA analysis can reveal about lexical organisation and ...
Tess Fitzpatrick +2 more
wiley +1 more source
4-Transitive Digraphs I: The Structure of Strong 4-Transitive Digraphs
Discussiones Mathematicae Graph Theory, 2013 Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A digraph D is transitive if for every three distinct vertices u, v,w ∈ V (D), (u, v), (v,w) ∈ A(D) implies that (u,w) ∈ A(D).
Hernández-Cruz César
doaj +1 more source
Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs [PDF]
, 2013 A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. A partially complemented digraph $\widetilde{G}$ is a digraph obtained from a sequence of vertex complement operations on $G ...
Joeris, Benson +3 more
core
International Transactions in Operational Research, EarlyView.Abstract Artificial intelligence (AI)‐enabled digital technologies have the potential to transform agriculture by supporting decision‐making and automating operations. However, their limited adoptions and scholars’ atheoretical explorations constrain our understanding.
Guoqing Zhao +5 more
wiley +1 more source
Skew-signings of positive weighted digraphs
Arab Journal of Mathematical Sciences, 2018 An arc-weighted digraph is a pair (D , ω) where D is a digraph and ω is an arc-weight function that assigns to each arc u v of D a nonzero real number ω (u v) .
Kawtar Attas +2 more
doaj +1 more source