Results 11 to 20 of about 34,890 (227)
Foundational Reading Knowledge of Teachers of Students With IDD: Examining Experience, Degree and Time Use. [PDF]
J Intellect Disabil ResABSTRACT Background Special education teachers require foundational reading content knowledge (e.g., phonemic awareness, phonics) to teach early reading skills. Though many measures have been developed to measure such knowledge, none have examined item‐level differences related to teacher characteristics (i.e., experience, degree and instructional time
Lindström ER +3 more
europepmc +2 more sources
New Applied Problems in the Theory of Acyclic Digraphs
Mathematics, 2021 The following two optimization problems on acyclic digraph analysis are solved. The first of them consists of determining the minimum (in terms of volume) set of arcs, the removal of which from an acyclic digraph breaks all paths passing through a subset
Gurami Tsitsiashvili, Victor Bulgakov
doaj +1 more source
$H$-kernels by walks in subdivision digraph [PDF]
Transactions on Combinatorics, 2020 Let $H$ be a digraph possibly with loops and $D$ a digraph without loops whose arcs are colored with the vertices of $H$ ($D$ is said to be an $H$-colored digraph).
Hortensia Galeana-Sánchez +3 more
doaj +1 more source
Generalized Neutrosophic Competition Graphs [PDF]
Neutrosophic Sets and Systems, 2020 The generalized neutrosophic graph is a generalization of the neutrosophic graph that represents a system perfectly. In this study, the concept of a neutrosophic digraph, generalized neutrosophic digraph and out-neighbourhood of a vertex of a ...
Kousik Das, Sovan Samanta, Kajal De
doaj +1 more source
Some results on the existence of Hamiltonian cycles in -compositions of bipartite digraphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let D be a digraph on n vertices s1, …, sn and let D1, …, Dn be a family of vertex-disjoint bipartite digraphs. We think of D1, …, Dn as 2-colored digraphs with the same color set.
Pilar Cano +2 more
doaj +1 more source
H-Kernels in Unions of H-Colored Quasi-Transitive Digraphs
Discussiones Mathematicae Graph Theory, 2021 Let H be a digraph (possibly with loops) and D a digraph without loops whose arcs are colored with the vertices of H (D is said to be an H-colored digraph). For an arc (x, y) of D, its color is denoted by c(x, y). A directed path W = (v0, . .
Campero-Alonzo José Manuel +1 more
doaj +1 more source
On the Italian reinforcement number of a digraph
AIMS Mathematics, 2021 The Italian reinforcement number of a digraph is the minimum number of arcs that have to be added to the digraph in order to decrease the Italian domination number. In this paper, we present some new sharp upper bounds on the Italian reinforcement number
Zhihong Xie +2 more
doaj +1 more source
Bounds for the skew Laplacian (skew adjacency) spectral radius of a digraph [PDF]
Transactions on Combinatorics, 2019 For a simple connected graph $G$ with $n$ vertices and $m$ edges, let $\overrightarrow{G}$ be a digraph obtained by giving an arbitrary direction to the edges of $G$.
Hilal A. Ganie
doaj +1 more source
On quotient digraphs and voltage digraphs
, 2016 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 their close relationship between voltage digraphs and line digraphs, which are two known approaches to obtain dense digraphs.
C. Dalfó +3 more
openalex +3 more sources
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meister, Daniel, Telle, Jan Arne
openaire +1 more source