Results 51 to 60 of about 9,505,081 (140)
Dispelling Myths and Misunderstandings About Defining and Remediating Dyslexia
Dyslexia, Volume 32, Issue 4, November 2026.ABSTRACT Despite a strong base of scientifically supported research on dyslexia, pervasive misunderstandings continue, particularly in the United States, where state legislation, instructional practices and parent advocacy intersect in ways that influence how dyslexia is identified and treated.
Christy R. Austin +4 more
wiley +1 more source
KONSTRUKSI DIGRAPH EKSENTRIS DENGAN MATRIKS ADJACENCY [PDF]
, 2004 The objective of this thesis is to find the connection between adjacency matrix of digraph and adjacency matrix of its eccentric dib'T3ph, and algorithm for constructing eccentric digraph from digraph based on the connection.
AGUS YASIN KURNIAWAN, 089911925
core +1 more source
Exact and Approximate Digraph Bandwidth [PDF]
, 2019 In 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
On (4,2)-digraph Containing a Cycle of Length 2 [PDF]
, 2000 A diregular digraph is a digraph with the in-degree and out-degree of all vertices is constant. The Moore bound for a diregular digraph of degree d and diameter k is M_{d,k}=l+d+d^2+...+d^k.
Baskoro, Edy Tri, Iswadi, Hazrul
core +2 more sources
When the arc-colored line digraph of a cayley colored digraph is again a cayley colored digraph
Let D6(G) be the Cayley colored ügraph of a finite group G generated by A. The arc-colored line digraph of a Cayley colored digraph ie obtained by appropriately coloring the arcs of its line digraph.
Fiol Mora, Maria Lluïsa +2 more
core
, 2007 This document describes how to use DiGraph/Occam. It assumes that the user has read the documentation for the basic editor: DiGraph: Users Guide. Refer to this document to learn how to use the basic graph editor.
Ivan Porres, Iv#n Porres Paltor
core
Dihedral butterfly digraph and its Cayley graph representation [PDF]
, 2008 In this paper, we present a new extension of the butterfly digraph, which is known as one of the topologies used for interconnection networks. The butterfly digraph was previously generalized from binary to d-ary.
Tanaka, Yuuki +6 more
core
Common circulant homogeneous factorisations of the complete digraph
, 2009 In this paper we determine the positive integers n and k for which there exists a homogeneous factorisation of a complete digraph on n vertices with k ‘common circulant’ factors.
Stringer, Linda +2 more
core +1 more source
H-kernels by walks in H-colored digraphs and the color-class digraph
, 2016 Let H be a digraph possibly with loops and D a finite digraph without loops whose arcs are colored with the vertices of H (D is an H-colored digraph). V(D) and A(D) will denote the sets of vertices and arcs of D respectively.
Rocío Sánchez-López +1 more
core +1 more source
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