On the size of identifying codes in triangle-free graphs

For instance, the hierarchical algorithms studied in Chapter 4 consider that clusters form a partition of the graph nodes at all level of the dendrogram, whereas it would be

Since isotopic signatures generally vary over a wide range for a given source (Sect. 2.3), we ran sim- ulations using the mean value and the extreme values of the range given in Table

Before we show that Theorem 2.8 is a consequence of Theorem 2.7, we make the following convention regarding constants implicit in O, , and  notation: these constants may always

The effective flow factor is defined as the normalized ratio of the average assembly power to the coolant temperature use in each instrumented fuel

The effects of proportion of finance CEOs increase the rate of marketing CEOs rather than finance CEOs, significant at the .10 level for Models I and II,. and at the .05 level for

Korpelainen, Lozin, and Mayhill [Split permutation graphs, Graphs and Combinatorics, 30(3):633–646, 2014] proved that there exist split graphs with Dilworth number 2 with

En effet, après avoir subi des modifications involontaires et automatiques à la vue d’un objet ou d’un événement extérieur (émotion), le sujet peut être amené à en

Assume A is a family of connected planar graphs that satisfies the previous condition, and let X n denote the number of connected components that belong to A in a random planar