Results 111 to 120 of about 8,697 (224)
Spanish‐Speaking Secondary Students Reading and Spelling in English as a Foreign Language
European Journal of Education, Volume 61, Issue 3, September 2026.ABSTRACT Proficiency in English reading and spelling is essential, as many professional environments require both spoken and written skills. Literacy development in English as a foreign language poses challenges for learners whose first language is transparent, such as Spanish, due to the complexity and inconsistency of English orthography.
Paz Suárez‐Coalla +3 more
wiley +1 more source
This paper considers a natural ruleset for playing a partisan combinatorial game on a directed graph, which we call Digraph Placement. Given a digraph $G$ with a not necessarily proper $2$-coloring of $V(G)$, the Digraph Placement game played on $G$ by ...
McKay, Neil A, Clow, Alexander
core +1 more source
Infinite kernel perfect digraphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a digraph, possibly infinite, V() and A() will denote the sets of vertices and arcs of , respectively. A subset of V() is said to be a kernel if it is both independent (a vertex in has no successor in ) and absorbing (a vertex not in has a ...
Rocío Sánchez-López
doaj +1 more source
Structural detectability analysis of cyber attacks for power grids via graph theory
IET Cyber-Physical Systems, 2018 Cyber-physical systems are pervasive in every walk of life. The safety performances of these systems are threatened by external malicious attacks and unforeseen failures. In terms of grid structural characteristics and graph theory, this study proposes a
Xiaoyuan Luo +2 more
doaj +1 more source
Studies in Applied Mathematics, Volume 157, Issue 3, September 2026.ABSTRACT We show that the removal of a type of reverse reactions preserves the absence of Hopf bifurcations in mass‐action reaction networks, or more precisely, the absence of single pairs of purely imaginary eigenvalues of the Jacobian of the system. The motivation is to answer the open question of whether the dual phosphorylation mechanism requiring ...
Elisenda Feliu, Nidhi Kaihnsa
wiley +1 more source
European Journal of Combinatorics, 2018 In 1995, Stiebitz asked the following question: For any positive integers $s,t$, is there a finite integer $f(s,t)$ such that every digraph $D$ with minimum out-degree at least $f(s,t)$ admits a bipartition $(A, B)$ such that $A$ induces a subdigraph with minimum out-degree at least $s$ and $B$ induces a subdigraph with minimum out-degree at least $t$?
Donglei Yang +3 more
openaire +2 more sources
DIGRAPH EKSENTRIS DARI POHON [PDF]
, 2002 Dari graph khususnya graph yang berbentuk pohon, dapat dibentuk digraph eksentris, yaitu digraph yang himpunan titiknya sama dengan himpunan titik pada pohon T dan terdapat busur dari u ke v pada ED (T), jika v titik eksentris dari u pada pohon ...
NENI ISNEINI, 089711667
core +1 more source
Distant digraph domination [PDF]
A k-kernel in a digraph G is a stable set X of vertices such that every vertex of G can be joined from X by a directed path of length at most k. We prove three results about k-kernels.
Nguyen, Tung, Scott, Alex, Seymour, Paul
core +2 more sources
Applied Mathematics in Science and EngineeringThe Halpern iteration method is among the most extensively studied approaches in the literature concerning the approximation of fixed points of G-nonexpansive mappings.
Esra Yolaçan
doaj +1 more source
, 2008 This document describes DiGraph version 0.9. When DiGraph starts it shows its version number. If the number shown is different from the version of this document, then this document is out of date. This document is divided in three main chapters.
Ivan Porres
core