S. Darbinyan

activity

20122018

most citedA Note on Long non-Hamiltonian Cycles in One Class of Digraphs

6 citations · 12 across the 6 of their papers we have counts for

collaborators

8 papers

math.CO2018★ 1 cited

A theorem on even pancyclic bipartite digraphs

Samvel Kh. Darbinyan

We prove that a strongly connected balanced bipartite directed graph of order $2 a \geq 6$ with partite sets $X$ and $Y$ contains cycles of every length $2, 4, \dots, 2 a$ , provided…

math.CO2018★ 1 cited

On Hamiltonian and Hamilton-connected digraphs

S. Kh. Darbinyan

C. Thomassen in \cite{[11]} suggested (see also \cite{[2]}, J. C.Bermond, C. Thomassen, Cycles in Digraphs - A survey, J. Graph Theory 5 (1981) 1-43, Conjectures 1.6.7 and 1.6.8) t…

math.CO2017

A sufficient condition for pre-Hamiltonian cycles in bipartite digraphs

Samvel Kh. Darbinyan, Iskandar A. Karapetyan

Let $D$ be a strongly connected balanced bipartite directed graph of order $2 a \geq 10$ other than a directed cycle. Let $x, y$ be distinct vertices in $D$ . ${x, y}$ dominates a ver…

math.CO2017★ 1 cited

On pre-Hamiltonian cycles in balanced bipartite digraphs

Samvel Kh. Darbinyan

Let $D$ be a strongly connected balanced bipartite directed graph of order $2 a \geq 10$ . Let $x, y$ be distinct vertices in $D$ . ${x, y}$ dominates a vertex $z$ if $x \to z$ …

math.CO2016

Sufficient conditions for Hamiltonian cycles in bipartite digraphs

Samvel Kh. Darbinyan

We prove two sharp sufficient conditions for hamiltonian cycles in balanced bipartite directed graph. Let $D$ be a strongly connected balanced bipartite directed graph of order $2a…

math.CO2016

On cyclability of digraphs

Samvel Kh. Darbinyan

Given a directed graph $D$ of order $n \geq 4$ and a nonempty subset $Y$ of vertices of $D$ such that in $D$ every vertex of $Y$ reachable from every other vertex of $Y$ . Assume tha…