Untersuchungen zur Modulation der Fibronectin-Liganden-Wechselwirkung

Ohne Zusammenfassung

---

Studies on the maodulation of the fibronectine-ligand intraction

     

Imperfect repair in degradation processes: A Kijima‐type approach

We consider a Wiener process with linear drift for degradation modeling. Regularly, maintenance actions are carried out which produce a reduction of the degradation level. In this paper, we consider the influence of such maintenance actions to the further development of the degradation process and the resulting lifetime distribution. A connection between virtual age in Kijima‐type models and degradation level in the underlying degradation process is developed. Furthermore, estimators for the process parameters as well as for the degree of repair are developed.     

Graph with given achromatic number

An irreducible (point-determining) graph is one in which distinct vertices have distinct neighbourhoods. Every graph X can be reduced to an irreducible graph X¹ by identifying all vertices with the same neighbourhood; the colourability properties of X¹ carry over to X. Hence irreducible graphs are instrumental in the study of achromatic number. We prove that there are only finitely many irreducible graphs with a given achromatic number, and describe all graphs with achromatic number less than four. We deduce certain bounds on the achromatic number X in terms of the number of vertices of X¹. In the course of the proofs we calculate the achromatic numbers of paths and cycles. Generalizations of the main theorem to homomorphisms other than colourings are discussed.