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

Irregularity is an important aspect of the cardiovascular system dynamics. Numerical indices irregularity, such as largest Lyapunov exponent and correlation dimension estimated from interbeat interval time series, are early markers diseases. However, there no consensus on origin irregularity in system. A common hypothesis suggests importance nonlinear bidirectional coupling between respiratory ...

High firing irregularity is a hallmark of cortical neurons in vivo, and modeling studies suggest a balance of excitation and inhibition is necessary to explain this high irregularity. Such a balance must be generated, at least partly, from local interconnected networks of excitatory and inhibitory neurons, but the details of the local network structure are largely unknown. The dynamics of the n...

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 this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on  a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of  level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity...