On a Problem of Wang Concerning the Hamiltonicity of Bipartite Digraphs
Mathematical Problems of Computer Science · 2018
DOI: 10.51408/1963-0003 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Problems of Computer Science, 2018. Verfasst von Samvel Darbinyan und 1 weiteren Autor:innen. Die Arbeit nennt 20 Literaturangaben.
Abstract (Originalsprache)
R. Wang (Discrete Mathematics and Theoretical Computer Science, vol. 19(3), 2017) proposed the following problem. Problem. Let D be a strongly connected balanced bipartite directed graph of order 2a ≥8. Suppose that d(x) ≥ 2a - k, d(y) ≥a + k or d(y) ≥2a - k, d(x) ≥a + k for every pair of vertices {x; y}with a common out-neighbour, where 2 • k • a=2. Is D Hamiltonian? In this paper, we prove that if a digraph D satis¯es the conditions of this problem, then (i) D contains a cycle factor, (ii) for every vertex x ∈ V (D) there exists a vertex y ∈ V (D) such that x and y have a common out-neighbour.
Zitieren
APA
Darbinyan, S., & Karapetyan, I. (2018). On a Problem of Wang Concerning the Hamiltonicity of Bipartite Digraphs. Mathematical Problems of Computer Science. https://doi.org/10.51408/1963-0003
Vancouver
Darbinyan S, Karapetyan I. On a Problem of Wang Concerning the Hamiltonicity of Bipartite Digraphs. Mathematical Problems of Computer Science. 2018. doi:10.51408/1963-0003
BibTeX
@article{Darbinyan2018,
author = {Darbinyan, Samvel and Karapetyan, Iskandar},
title = {On a Problem of Wang Concerning the Hamiltonicity of Bipartite Digraphs},
journal = {Mathematical Problems of Computer Science},
year = {2018},
doi = {10.51408/1963-0003}
}
EUVIMED