Results 131 to 140 of about 8,914 (221)
ELT Worldwide: Journal of English Language TeachingThis paper attempts to measure how pupils at primary schools benefit from controlled dictation practice in the learning of letter-to-sound correspondences.
Ezzeldin Mahmoud Ali, Zuhayra Ashareef
doaj +1 more source
Locally Semicomplete Digraphs and Generalizations
, 2018 The class of locally semicomplete digraphs was discovered by Bang-Jensen in 1988. Locally semicomplete digraphs form a significant generalization of semicomplete digraphs with a very rich structure.
Jørgen Bang-Jensen +1 more
core +1 more source
Arbitrarily Partitionable Digraphs
In this work, we investigate how the notion of arbitrarily partitionable graph transfers from graphs to digraphs. Recall that a graph is arbitrarily partitionable if it can be partitioned into arbitrarily many connected graphs with arbitrary orders.
Baudon, Olivier +2 more
core +2 more sources
The 3-dicritical semi-complete digraphs
A digraph is $3$-dicritical if it cannot be vertex-partitioned into two sets inducing acyclic digraphs, but each of its proper subdigraphs can. We give a human-readable proof that the number of 3-dicritical semi-complete digraphs is finite.
Picasarri-Arrieta, Lucas +2 more
core +3 more sources
On quotient digraphs and voltage digraphs
, 2017 Research of the first two authors is supported by MINECO under project MTM2014-60127-P, and by AGAUR under project 2014SGR1147. The first author has also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 734922.
Dalfó Simó, Cristina +3 more
openaire +2 more sources
From subKautz digraphs to cyclic Kautz digraphs
Kautz digraphs K(d,l) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz digraphs CK(d,l) were recently introduced by Böhmová, Huemer and the author, and ...
Dalfó Simó, Cristina
core +1 more source
Double trouble: Using spellings of different lengths to represent vowel length in English. [PDF]
J Exp Child Psychol, 2023 Altmiller R, Treiman R, Kessler B.
europepmc +1 more source
From expanded digraphs to lifts of voltage digraphs and line digraphs
In this note we present a general approach to construct large digraphs from small ones. These are called expanded digraphs, and, as particular cases, we show the close relationship between lifted digraphs of voltage digraphs and line digraphs, which are ...
M. A. Fiol (21312803) +3 more
core
Consensus Control of Saturated Multi-Agent Systems with Heterogeneous Asymmetric Saturation Constraints Under Flexible Topologies. [PDF]
Sensors (Basel)Wang Z, Yang J, Yang H, Jin Z.
europepmc +1 more source