Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...

hyper ige syndrome (hies) is a rare primary immunodeficiency disease. most of hies cases are sporadic. hies type ad is caused by mutation in signal transducer and activator of transcription-3 (stat-3). a number of mosaicism hies has been reported that is associated with intermediate phenotype. autosomal recessive hies (ar-hies) is due to mutation in dock-8 or cytokine sis 8 and tyk2 or tyrosine...

background: asthma is a multifactorial disease and its severity varies with the inflammatory grade. there are conflicting reports about the roles of trace elements in asthma. this study examined the effects of zinc (zn), copper (cu), and selenium (se) concentrations in sera of patients with allergic asthma attending ghaem hospital, mashhad, iran. methods: forty-nine patients, aged 10 to 50 year...

In this study, a hyper-redundant manipulator was designed for detection and searching in narrow spaces aerospace earthquake rescue applications. A forward kinematics equation the derived using homogeneous coordinate transformation method. Based on modal function backbone curve method known path, an improved curves proposed. First, configuration of divided into two parts: mode segment path segme...

hyper-igm syndromes are characterized by profound reduction of serum igg, iga, and ige levels with normal or increased concentrations of serum igm. cd40 ligand deficiency is x-linked form of the disease, which results in a lack of immunoglobulin class switching from igm to igg in b cells. in addition to the recurrent infections, a number of patients suffer from neutropenia. there are some evide...

Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen intensive research over the last years. Unfortunately, the best known algorithms for computing the hyperbolicity number of a graph (the smaller, the more tree-like) have running time O(n), where n is the number of graph ...

.............................................................................................. I Acknowledgements ............................................................................ II ركشو ءادهآ .............................................................................................. IV List of Figures .................................................................................