the probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. a discrete time markov chain with an absorbing state is established in a directed acyclic network. then, the probability of transition from the initial state to the absorbing state is computed. it is as...

in this survey, we give an overview over some aspects of the set of tilting objects in an $m-$cluster category, with focus on those properties which are valid for all $m geq 1$. we focus on the following three combinatorial aspects: modeling the set of tilting objects using arcs in certain polygons, the generalized assicahedra of fomin and reading, and colored quiver mutation.

The problem of coloring a subgraph of any weighted circular-arc graph with a set of k colors is studied in this paper. In such a coloring, two overlapping arcs must receive different colors. Our main result is to derive a 2-approximation algorithm for the NP-hard problem of finding a maximum total weight k-colorable subgraph of any weighted circular-arc graph, and this algorithm runs in O(mloge...

This paper considers the n-point Gauss-Jacobi approximation of nonsingular integrals of the form ∫ 1 −1 μ(t)φ(t) log(z− t) dt, with Jacobi weight μ and polynomial φ, and derives an estimate for the quadrature error that is asymptotic as n → ∞. The approach follows that previously described by Donaldson and Elliott. A numerical example illustrating the accuracy of the asymptotic estimate is pres...

This paper is to develop a knowledge management (KM) model in some Iranian academic research centers (ARC) based on KM critical success factors. General KM critical success factors (CSF) were identified through literature review. Then the research procedure led to the identification of KM critical success factors in Iranian ARCs including 16 different factors. It was done through first stage su...

A directed graph is called Eulerian, if it contains a tour that traverses every arc in the graph exactly once. We study the problem of Eulerian Extension (EE) where a directed multigraph G and a weight function is given and it is asked whether G can be made Eulerian by adding arcs whose total weight does not exceed a given threshold. This problem is motivated through applications in vehicle rou...

Let $D$ be a finite and simple digraph with vertex set $V(D)$‎.‎A signed total Roman $k$-dominating function (STR$k$DF) on‎‎$D$ is a function $f:V(D)rightarrow{-1‎, ‎1‎, ‎2}$ satisfying the conditions‎‎that (i) $sum_{xin N^{-}(v)}f(x)ge k$ for each‎‎$vin V(D)$‎, ‎where $N^{-}(v)$ consists of all vertices of $D$ from‎‎which arcs go into $v$‎, ‎and (ii) every vertex $u$ for which‎‎$f(u)=-1$ has a...