background: h e r2/ n eu i so n e o ftheepi de rmalg r owth f actor r e c e pt o rsfami l i e s andsee m stohaveprognosticsignificanceofsomesolid t umors.theo b jecti v eof thisstu d yistoevaluatet h epossi b ilityofher2ex p ressioningastricca n cersand the p o s si b le r e lat i o n ship o fh e r2withtumo r ’scli n icopat h o l o gicpara m e te r sa n d a l s oits pr o gno s tic r o l e .   m...

Let e be an edge of a G connecting the vertices u and v. Define two sets N1 (e | G) and N2(e |G) as N1(e | G)= {xV(G) d(x,u) d(x,v)} and N2(e | G)= {xV(G) d(x,v) d(x,u) }.The number of elements of N1(e | G) and N2(e | G) are denoted by n1(e | G) and n2(e | G) , respectively. The Szeged index of the graph G is defined as Sz(G) ( ) ( ) 1 2 n e G n e G e E    . In this paper we compute th...

‎let g=(v,e) be a simple connected graph with vertex set v and edge set e. the first, second and third zagreb indices of g are respectivly defined by: $m_1(g)=sum_{uin v} d(u)^2, hspace {.1 cm} m_2(g)=sum_{uvin e} d(u).d(v)$ and $ m_3(g)=sum_{uvin e}| d(u)-d(v)| $ , where d(u) is the degree of vertex u in g and uv is an edge of g connecting the vertices u and v. recently, the first and second m...

let z2 = {0, 1} and g = (v ,e) be a graph. a labeling f : v → z2 induces an edge labeling f* : e →z2 defined by f*(uv) = f(u).f (v). for i ε z2 let vf (i) = v(i) = card{v ε v : f(v) = i} and ef (i) = e(i) = {e ε e : f*(e) = i}. a labeling f is said to be vertex-friendly if | v(0) − v(1) |≤ 1. the vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. in this paper ...

Governments worldwide have, increasingly, implemented e-government initiatives for their potential significant benefits; among which, delivering better services to citizens through increasing citizens' convenience, satisfaction, and independence; and saving their time, effort, and cost. Achieving each benefit is an objective to these governments and fulfilling each objective is considered a cri...