Results 121 to 130 of about 16,499 (231)
Discrete Mathematics, 2000 Let \(G\) denote a strongly-connected digraph with \(n\) nodes, girth \(g\), and diameter \(D\). The author shows that if \(G\) has \(t\) nodes of out-degree one, then \(D\leq n-g+ t\). He also shows that if \(r\) denotes the minimum out-degree of \(G\), then \(g\leq \max\{\lceil n/r\rceil, 2r- 2\}\). This last result implies that when \(n\geq 2r^2- 3r+
openaire +2 more sources
Discrete Mathematics, 2001 The author studies the problem of upward embedding on the round sphere and gives a characterization of all spherical digraphs.
openaire +2 more sources
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
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.
Dalfó Simó, Cristina +3 more
openaire +1 more source
Journal of Combinatorial Mathematics and Combinatorial ComputingA ( 0 , 1 ) -labeling of a set is said to be friendly if the number of elements of the set labeled 0 and the number labeled 1 differ by at most 1. Let g be a labeling of the edge set of a graph that is induced by a labeling f of the vertex set. If both g and f are friendly then g is said to be a cordial labeling of the graph.
openaire +2 more sources
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
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
Structural properties and isomorphism theorems for Cayley digraphs of full transformation semigroups with respect to Green's equivalence classes. [PDF]
Heliyon, 2023 Nupo N, Chaiya Y.
europepmc +1 more source
KR4SL: knowledge graph reasoning for explainable prediction of synthetic lethality. [PDF]
Bioinformatics, 2023 Zhang K, Wu M, Liu Y, Feng Y, Zheng J.
europepmc +1 more source