Results 81 to 90 of about 6,654 (223)
Lexical Syllabus in Elementary and Secondary Education: Construction and Implementation
TESOL Quarterly, EarlyView.Abstract Nonnative language users operate with significantly limited vocabularies compared to native speakers, particularly when the language is learnt in school contexts. This paper demonstrates how empirical research on vocabulary learning combined with experience in teaching and curricula design has informed the principled construction of a lexical ...
Batia Laufer
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2018 A digraph is called irregular if its distinct vertices have distinct degree pairs. An irregular digraph is called minimal (maximal) if the removal of any arc (addition of any new arc) results in a non-irregular digraph. It is easily seen that the minimum
Górska Joanna +4 more
doaj +1 more source
A new sufficient condition for a 2-strong digraph to be Hamiltonian [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn this paper we prove the following new sufficient condition for a digraph to be Hamiltonian: {\it Let $D$ be a 2-strong digraph of order $n\geq 9$. If $n-1$ vertices of $D$ have degrees at least $n+k$ and the remaining vertex has degree at least $n-
Samvel Kh. Darbinyan
doaj +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
A digraph group is a group defined by non-empty presentation with the property that each relator is of the form R(x, y), where x and y are distinct generators and R(·, ·) is determined by some fixed cyclically reduced word R(a, b) that involves both a ...
Williams, Gerald, Cihan, Mehmet Sefa
core +1 more source
Communications in Combinatorics and Optimization, 2016 Let $D$ be a finite and simple digraph with vertex set $V(D)$. For a vertex $v\in V(D)$, the degree of $v$, denoted by $d(v)$, is defined as the minimum value of its out-degree $d^+(v)$ and its in-degree $d^-(v)$.
L. Volkmann
doaj +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
Exact and Approximate Digraph Bandwidth [PDF]
International audienceIn this paper, we introduce a directed variant of the classical Bandwidth problem and study it from the view-point of moderately exponential time algorithms, both exactly and approximately.
Jain, Pallavi +4 more
core +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
Discrete Mathematics, 2006 Let $Φ(x,y)$ be a bivariate polynomial with complex coefficients. The zeroes of $Φ(x,y)$ are given a combinatorial structure by considering them as arcs of a directed graph $G(Φ)$. This paper studies some relationship between the polynomial $Φ(x,y)$ and the structure of $G(Φ)$.
Josep M. Brunat, Antonio Montes
openaire +2 more sources