Work

A sufficient condition for pre-Hamiltonian cycles in bipartite digraphs

Year: 2017

Type: conference-paper

Abstract: A cycle in a balanced bipartite digraph is called a pre-Hamiltonian if it contains all the vertices of the balanced bipartite digraph except two. In this paper we give a sufficient condition for the existence of pre-Hamiltonian cycle in a strongly connected balanced bipartite digraph.

Source: Computer Science and Information Technologies (CSIT)

DOI: 10.1109/csitechnol.2017.8312150

Authors: Samvel Darbinyan, Iskandar Karapetyan

Institutions: Institute for Informatics and Automation Problems, National Academy of Sciences of Armenia

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2962785705

FWCI: 0.72

Cites: 24

Cited by: 5

Related to: 10