Iskandar A. Karapetyan

collaborators

2 papers

math.CO2014

On Cycles through Vertices of Large Semidegree in Digraphs

S. Kh. Darbinyan, I. A. Karapetyan

Let $D$ be a strong digraph on $n = 2 m + 1 \geq 5$ vertices. In this paper we show that if $D$ contains a cycle of length $n - 1$ , then $D$ has also a cycle which contains all vertices wi…

math.CO2014

On Hamiltonian Bypasses in one Class of Hamiltonian Digraphs

Samvel Kh. Darbinyan, Iskandar A. Karapetyan

Let $D$ be a strongly connected directed graph of order $n \geq 4$ which satisfies the following condition (*): for every pair of non-adjacent vertices $x, y$ with a common in-neigh…