consider the random walk among n places with n(n - 1)/2 transports. we attach an exponential random variable xij to each transport between places pi and pj and take these random variables mutually independent. if transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...

soil characteristics is very important in water erosion processes. the present investigation was conducted in gully lands of ardebil province, iran, to assess the role of soil texture and structure on aggregate stability using wet sieve method. to achieve the study purposes, mean weighted diameter of aggregates was calculated, and its relationships with lime and clay percentages, sodium absorpt...

modelling of crack propagation by finite element method under mixed mode conditions is of prime importance in fracture mechanics. this paper describes an application of finite element method to the analysis of mixed mode crack growth in linear elastic fracture mechanics. crack growth process is simulated by an incremental crack-extension analysis based on the maximum principal stress criterion,...

It is well known that every tournament has a directed path containing all the vertices of V , i.e. a hamiltonian path. It is an easy exercise to show that a tournament has a unique such path if and only if the arcs of A induce a transitive relation on V . In this paper we show that by reversing the arcs of the hamiltonian path in a transitive tournament with n vertices we obtain a tournament wi...

Path integration is a respected form of quantization that all theoretical quantum physicists should welcome. This elaboration begins with simple examples three different versions path integration. After an important clarification how gravity can be properly quantized, appropriate integral, also incorporates necessary constraint issues, becomes proper integral for effectively obtained. How to ev...

Recently, the authors [Electron. J. Combin. 29 (2022), Paper No. 4.8] gave Ramsey-type results for path cover/partition number of graphs. In this paper, we continue research about them focusing on digraphs, and find a relationship between forbidden structures in digraphs. Let D be weakly connected digraph. A family P subdigraphs is called cover (resp. partition) if ⋃P∈PV(P)=V(D) ⋃˙P∈PV(P)=V(D))...