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

let f, g and h be all entire functions of several complex variables. in this paper we would like to establish some inequalities on the basis of relative order and relative lower order of f with respect to g when the relative orders and relative lower orders of both f and g with respect to h are given.

Let f, g and h be all entire functions of several complex variables. In this paper we would like to establish some inequalities on the basis of relative order and relative lower order of f with respect to g when the relative orders and relative lower orders of both f and g with respect to h are given.

G protein-coupled receptor (GPCR) kinases (GRKs) selectively recognize and are allosterically regulated by activated GPCRs, but the molecular basis for this interaction is not understood. Herein, we report crystal structures of GRK6 in which regions known to be critical for receptor phosphorylation have coalesced to stabilize the kinase domain in a closed state and to form a likely receptor doc...