Distance-hereditary graphs are in important graph class theory, as they well-placed the hierarchy and permit many algorithmic results. We investigate structural advantages of a directed version this well-researched class. Since previously defined distance-hereditary digraphs do not recursive structure, we define twin-distance-hereditary graphs, which can be constructed by several twin pendant v...

hearing loss (hl) is the most common communication disorder affecting about 1/1000 births worldwide caused by environmental or genetic factors. about 30-50% is attributed to genetic factors and till now more than 85 genes have been implicated in non-syndromic hl. in iran, hl is second to intellectual disability as the most common disability, affecting 1 of every 166 persons. about 15 years ago ...

objectives: the prevalence of consanguineous marriage is about 30 % in iran and this can increase the probability of incidence of genetic impairments such as hearing impairments. hearing impairment in comparison with other hereditary disorders is the most incident. the purpose of this survey is to identify the prevalence of consanguinity among the parents of sensoryneural hearing impaired stude...

conclusions: the hereditary stability analysis of the uv mentioning 45 minutes revealed the uv exposure time for mutants and 3 represented the colony taken from the plate irradiated for 45 minutes mutant showed that the production of avermectin b1b remained constant and no reverse mutation occurred after 15 generations. results: avermectin b1b-hyper-producing mutant, produced using these three ...

introduction: the main inhibitors of coagulation pathway are antithrombin (at), protein c and protein s. these inhibitors are necessary to prevent thromboembolism. hereditary deficiency of inhibitors is the main cause of alteration in balance between the anti-clotting and the formation of thrombin. patients with this abnormality are susceptible to venous thromboembolism (vte). two major clinica...

Given a quasi-hereditary superalgebra A, the first author and R. Muth have defined generalized Schur bi-superalgebras TA(n) proved that these algebras are again quasi-hereditary. In particular, comes with family of standard modules. Developing work Donkin Mathieu on good filtrations, we prove tensor product modules over has filtration.

A graph is said to be distance-hereditary if the distance function in every connected induced subgraph same as itself. We prove that ordinary Weisfeiler–Leman algorithm tests isomorphism of any two graphs one them distance-hereditary; more precisely, dimension class finite equal 2. The previously best known upper bound for was 7.