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...

Let G and H be two graphs. The corona product G o H is obtained by taking one copy of G and |V(G)| copies of H; and by joining each vertex of the i-th copy of H to the i-th vertex of G, i = 1, 2, …, |V(G)|. In this paper, we compute PI and hyper–Wiener indices of the corona product of graphs.

Let Γ=(V,E) be a graph and ‎W_(‎a)={w_1,…,w_k } be a subset of the vertices of Γ and v be a vertex of it. The k-vector r_2 (v∣ W_a)=(a_Γ (v,w_1),‎…‎ ,a_Γ (v,w_k)) is the adjacency representation of v with respect to W in which a_Γ (v,w_i )=min{2,d_Γ (v,w_i )} and d_Γ (v,w_i ) is the distance between v and w_i in Γ. W_a is called as an adjacency resolving set for Γ if distinct vertices of ...

Abstract We analyze the situation when original graph is split at edges and vertices into two disconnected subgraphs. show that there a relationship between generalized Euler characteristic  <mml:...