S. Darbinyan

activity

20112025

most citedA sufficient condition for the hamiltonian property of digraphs with large semi-degrees

10 citations · 42 across the 21 of their papers we have counts for

collaborators

Showing 2014 · math.COShow all

4 papers · 2 filters

math.CO2014

On Hamiltonian Bypasses in Digraphs with the Condition of Y. Manoussakis

Samvel Kh. Darbinyan

Let $D$ be a strongly connected directed graph of order $n \geq 4$ vertices which satisfies the following condition for every triple $x, y, z$ of vertices such that $x$ and $y$ are no…

math.CO2014★ 3 cited

On pre-Hamiltonian Cycles in Hamiltonian Digraphs

Samvel Kh. Darbinyan

Let $D$ be a strongly connected directed graph of order $n \geq 4$ . In \cite{[14]} (J. of Graph Theory, Vol.16, No. 5, 51-59, 1992) Y. Manoussakis proved the following theorem: Supp…

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…