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 2023 · math.COShow all

3 papers · 2 filters

math.CO2023★ 1 cited

A new sufficient condition for a 2-strong digraph to be Hamiltonian

Samvel Kh. Darbinyan

In this paper we prove the following new sufficient condition for a digraph to be Hamiltonian: {\it Let $D$ be a 2-strong digraph of order $n \geq 9$ . If $n - 1$ vertices of $D$ have…

math.CO2023★ 1 cited

A Note on Hamiltonian Cycles in Digraphs with Large Degrees

Samvel Kh. Darbinyan

In this note we prove: {\it Let $D$ be a 2-strong digraph of order $n$ such that its $n - 1$ vertices have degrees at least $n + k$ and the remaining vertex $z$ has degree at least $n-…

math.CO2023★ 2 cited

On Hamiltonian Bypasses in Digraphs satisfying Meyniel-like Condition

Samvel Kh. Darbinyan

Let $G$ be a strongly connected directed graph of order $p \geq 3$ . In this paper, we show that if $d (x) + d (y) \geq 2 p - 2$ (respectively, $d (x) + d (y) \geq 2 p - 1$ ) for every pair of non-ad…