二部有向图中前哈密顿环的一个充分条件

2017 Computer Science and Information Technologies (CSIT) Pub Date : 2017-06-01 DOI:10.1109/CSITECHNOL.2017.8312150

S. Darbinyan, I. Karapetyan

{"title":"二部有向图中前哈密顿环的一个充分条件","authors":"S. Darbinyan, I. Karapetyan","doi":"10.1109/CSITECHNOL.2017.8312150","DOIUrl":null,"url":null,"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.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A sufficient condition for pre-Hamiltonian cycles in bipartite digraphs\",\"authors\":\"S. Darbinyan, I. Karapetyan\",\"doi\":\"10.1109/CSITECHNOL.2017.8312150\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":332371,\"journal\":{\"name\":\"2017 Computer Science and Information Technologies (CSIT)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Computer Science and Information Technologies (CSIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSITECHNOL.2017.8312150\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Computer Science and Information Technologies (CSIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSITECHNOL.2017.8312150","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

平衡二部有向图中的一个环，如果它包含平衡二部有向图中除两个顶点以外的所有顶点，则称为前哈密顿环。本文给出了强连通平衡二部有向图上存在前哈密顿环的充分条件。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A sufficient condition for pre-Hamiltonian cycles in bipartite digraphs

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2017 Computer Science and Information Technologies (CSIT)

自引率

0.00%

发文量