A note on the neighbour-distinguishing index of digraphs

More precisely, it is shown that six known bounds for the index of convergence, i.e., transient, of unweighted digraphs also apply to weighted digraphs, namely to the transients

We give purely graph theoretic parame- ters (i.e., without reference to strings) that are exactly (respectively, asymp- totically) equivalent to readability for trees (respectively, C

After controlling for multiple testing, the following discordant site associations were signi ficant at α = 0.05: oral and pharyngeal cancer and FH of laryngeal cancer (OR =

In addition, while Filotti, Miller and Reif [12] have shown that the question whether an undirected graph has an embedding on a fixed sur- face has polynomial time algorithm,

other examples in that they represent a situation as bounded. This obser vation has important consequences for the expression of temporal relations in past time sentences.

quickly raised to 35 or 40 per cent, and condensation occurred within a few hours, with very heavy frost in all spaces (except Space 5): on the north side 100 per cent, and on the

Ce pitch pour film d’anticipation à petit budget a pour avantage de nous révéler l’existence de processus complexes intriqués à diffé- rentes échelles de temps et d’espace

Finally, the last cluster showcases transformative knowledge building through chapters on embodied learning and metaphors in elementary mathematics, the fusion of dance, movement,