Object

Title: Sufficient conditions for Hamiltonian cycles in bipartite digraphs

Abstract:

We prove two sufficient conditions for Hamiltonian cycles in balanced bipartite digraphs. Let D be a strongly connected balanced bipartite digraph of order 2a. Then: (i) If a≥4 andmax{d(x),d(y)}≥2a−1 for every pair of vertices {x,y} with a common out-neighbour, then either D is Hamiltonian or D is isomorphic to a certain digraph of order eight which we specify. (ii) Ifa≥4 andd(x)+d(y)≥4a−3 for every pair of vertices {x,y} with a common out-neighbour, then D is Hamiltonian. The first result improves a theorem of Wang and the second result, in particular, establishes a conjecture due to Bang-Jensen, Gutin and Li for strongly connected balanced bipartite digraphs of orders at least eight.

Publisher:

Elsevier

Date submitted:

01.03.2018

Date accepted:

19.11.2018

Date of publication:

17.12.2019

Identifier:

oai:noad.sci.am:136149

DOI:

10.1016/j.dam.2018.11.024

ISSN:

0166-218X

Language:

English

Journal or Publication Title:

Discrete Applied Mathematics

Volume:

258

URL:


Additional Information:

samdarbin@ipia.sci.am

Affiliation:

Institute for Informatics and Automation Problems

Country:

Armenia

Indexing:

WOS

Object collections:

Last modified:

Apr 19, 2021

In our library since:

Apr 19, 2021

Number of object content hits:

11

All available object's versions:

https://noad.sci.am/publication/149561

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

This page uses 'cookies'. More information