In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...

‎In this paper we defined the vertex removable cycle in respect of the following‎, ‎if $F$ is a class of graphs(digraphs)‎ ‎satisfying certain property‎, ‎$G in F $‎, ‎the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $.‎ ‎The vertex removable cycles of eulerian graphs are studied‎. ‎We also characterize the edge removable cycles of regular‎ ‎graphs(digraphs).‎    

We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591-approximation to the minimum latency problem, improving on previous algorithms by a multiplicative factor of 2. Our techniques also give similar improvements for related problems like k-traveling repairmen and its multiple depot variant. We also observe that standard techniqu...

We develop a theory of removable singularities for the weighted Bergman space Aμ(Ω) = {f analytic in Ω : R Ω |f | dμ < ∞}, where μ is a Radon measure on C. The set A is weakly removable for Aμ(Ω \ A) if Aμ(Ω \ A) ⊂ Hol(Ω), and strongly removable for Aμ(Ω \A) if Aμ(Ω \A) = Aμ(Ω). The general theory developed is in many ways similar to the theory of removable singularities for Hardy H spaces, BMO...