Autologous bone grafts remain the gold standard for the treatment of congenital craniofacial disorders; however, there are potential problems including donor site morbidity and limitations to the amount of bone that can be harvested. Recent studies suggest that granulocyte colony-stimulating factor (G-CSF) promotes fracture healing or osteogenesis. The purpose of the present study was to invest...

Let G = Fqo 〈β〉 be the semidirect product of the additive group of the field of q = p elements and the cyclic group of order d generated by the invertible linear transformation β defined by multiplication by a power of a primitive root of Fq. We study endomorphisms of G. We find an arithmetic condition on d so that every endomorphism is determined by its values on (1, 1) and (0, β). When that i...

Let α(G) and β(G) be the independent number and vertex covering number of G, respectively. The Kronecker Product G1 ⊗ G2 of graph of G1 and G2 has vertex set V (G1 ⊗ G2) = V (G1) × V (G2) and edge set E(G1 ⊗ G2) = {(u1v1)(u2v2)|u1u2 ∈ E(G1) and v1v2 ∈ E(G2)}. In this paper, let G is a simple graph with order p, we prove that, α(Km,n⊗G)= max {(m+n)α(G),p max{m,n}} and β(Km,n⊗G) =min {(m + n)β(G)...

In this paper, we define distance partition of vertex set of a graph G with reference to a vertex in it and with the help of the same, a graph with metric dimension two (i.e. 2 ) ( = G β ) is characterized. In the process, we develop a polynomial time algorithm that verifies if the metric dimension of a given graph G is two. The same algorithm explores all metric bases of graph G whenever 2 ) (...

background: many efforts have been undertaken until now to find an alternative approach to packed red cell tranfusion in major β-thalassemia. augmentation of fetal hemoglobin by hydroxyurea has proved to be less effective in this condition as compared to sickle cell anemia, probably due to molecular heterogeneity of the former disease. hydroxyurea efficacy and its relation to xmn1 polymorphism ...

We introduce a family of hypergroups, called weakly complete, generalizing the construction complete hypergroups. Starting from given group G, our prescribes β-classes hypergroups and allows some hyperproducts not to be parts, based on suitably defined relation over G. The commutativity degree can related that underlying group. Furthermore, in analogy commutativity, we completeness finite analy...

Let G be a directed graph and k a positive integer. We define the k-color graph of G (Dk(G) for short) as the directed graph having all k-colorings of G as node set, and where two k-colorings β and φ are joined by a directed edge β → φ if φ is obtained from β by choosing a vertex v and recoloring v so that its color is different from the colors of all its out-neighbors. We investigate reachabil...