g l o b a l c o m p e t i t i v e n e s s h a s r e c e n t l y b e c o m e a b i g c h a l l e n g e f o r m a n y c o m p a n i e s a r o u n d t h e w o r l d, w h i c h a r e f o r c e d t o s e e k l o w e r c o s t s a n d h i g h e r q u a l i t y f o r w h a t t h e y p r o d u c e. t h e p r o s p e r i t y o f m a n u f a c t u r i n g f i r m s d e p e n d s o n s e l e c t i n g a n...

Todeschini et al. have recently suggested to consider multiplicative variants of additive graph invariants, which applied to the Zagreb indices would lead to the multiplicative Zagreb indices of a graph G, denoted by ( ) 1  G and ( ) 2  G , under the name first and second multiplicative Zagreb index, respectively. These are define as     ( ) 2 1 ( ) ( ) v V G G G d v and ( ) ( ) ( ) ( ) 2...

indoor radon concentrations, the annual effective dose rate and the annual equivalent dose rate to the lung and to the public were measured in the dwellings of 10 neighborhoods located on the west side of the river tigris (al-karkh) in baghdad city using passive dosimeters. cr-39 solid state nuclear track detector (ssntd) technique was used for radon measurements. ninety-one dosimeters were dis...

A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...

s i n c e t h e l a t e 1960s, s e v e r a l c o n s t i t u t i v e m o d e l s h a v e b e e n d e v e l o p e d f o r s a n d s d e s c r i b i n g t h e i r s t r e s s-s t r a i n e h a v i o r. m o s t o f t h e s e m o d e l s w e r e e s t a b l i s h e d b a s e d o n a m e a s u r e o f t h e p l a s t i c w o r k a n d s o m e y i e l d c r i t e r i a, a m o n g t h e m b e i n g t ...