An assignment of positive integer weights to the edges of a simple graph G is called irregular, if the weighted degrees of the vertices are all different. The irregularity strength, s(G), is the maximal weight, minimized over all irregular assignments. In this study, we show that s(G) c1 n / , for graphs with maximum degree n and minimum

One of the important clinical features that differentiates benign melanocytic nevi from malignant melanomas is the irregularity of the lesion border. There are two types of border irregularities: texture irregularities, the small variations along the border, and structure irregularities, the global indentations and protrusions. Texture irregularities are subject to noise, whereas structure irre...

Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strengths of graphs. In this paper we discuss how the addition of new edge affect the total vertex irregularity strength.

Conventional wisdom holds that productive morphology is regular morphology. Drawing evidence from French, we argue that the description of many lexeme formation processes is simplified if we hold that a productive rule may give rise to inflectionally irregular lexemes. We argue that the notion of a stem space allows for a straightforward description of this phenomenon: each lexeme comes equippe...

In vivo cortical neurons are known to exhibit highly irregular spike patterns. Because the intervals between successive spikes fluctuate greatly, irregular neuronal firing makes it difficult to estimate instantaneous firing rates accurately. If, however, the irregularity of spike timing is decoupled from rate modulations, the estimate of firing rate can be improved. Here, we introduce a novel c...