Results 91 to 100 of about 16,499 (231)
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
The Uniqueness of Almost Moore Digraphs with Degree 4 And Diameter 2
Journal of Mathematical and Fundamental Sciences, 2019 . It is well known that Moore digraphs of degree d > 1 and diameter k > 1 do not exist. For degrees 2 and 3, it has been shown that for diameter k ≥ 3 there are no almost Moore digraphs, i.e.
Rinovia Simanjuntak, Edy Tri Baskoro
doaj
The Clique-Width of Minimal Series-Parallel Digraphs
AlgorithmsMSP DAGs (short for minimal series-parallel digraphs) can be defined from the single vertex graph by applying the parallel composition and series composition.
Frank Gurski, Ruzayn Quaddoura
doaj +1 more source
EXTREMAL IOTA ENERGY OF A SUBCLASS OF TRICYCLIC DIGRAPHS AND SIDIGRAPHS [PDF]
Matrix Science Mathematic, 2018 The iota energy of an n-vertex digraph D is defined by Ec (𝐷) = ∑ 1 |Im(𝑧 k)|, where z1, . . ., zn are eigenvalues of D and Im(zk) is the imaginary part of eigenvalue zk . The iota energy of an n-vertex sidigraph can be defined analogously.
Fareeha Jamal, Mehtab Khan
doaj +1 more source
Vertex-quasiprimitive 2-arc-transitive digraphs
Ars Math. Contemp., 2017 We study vertex-quasiprimitive 2 -arc-transitive digraphs, and reduce the problem of vertex-primitive 2 -arc-transitive digraphs to almost simple groups.
Michael Giudici, Binzhou Xia
semanticscholar +1 more source
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
Advances in Mathematics, 1996 The author applies the language of Joyal's species to enumeration problems of digraphs using the machinery of coloured species, see, e.g., the author and \textit{O. Nava} [J. Comb. Theory, Ser. A 64, No. 1, 102-129 (1993; Zbl 0787.05095)]. A species over digraphs is defined as a functor from the category of digraphs to the category of finite sets and ...
openaire +2 more sources
Context‐free graphs and their transition groups
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
wiley +1 more source
Halin's Grid Theorem for Digraphs
Journal of Graph Theory, Volume 113, Issue 1, Page 97-112, September 2026.ABSTRACT Halin showed that every thick end of every graph contains an infinite grid. We extend Halin's theorem to digraphs. More precisely, we show that for every infinite family ℛ of disjoint equivalent out‐rays there is a grid whose vertical rays are contained in ℛ
wiley +1 more source
A remark on the second neighborhood problem
Electronic Journal of Graph Theory and Applications, 2015 Seymour's second neighborhood conjecture states that every simple digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. Such a vertex is said to have the second neighborhood property (SNP).
Salman Ghazal
doaj +1 more source