Pancyclicity in strong k-quasi-transitive digraphs of large diameter

César Hernández-Cruz and Manuel Alejandro Juárez-Camacho

Applied Mathematics and Computation, 2021, vol. 408, issue C

Abstract: A digraph is k-quasi-transitive if the existence of a directed path of length k from vertex u to vertex v implies that u and v are adjacent; this family is a generalization of both tournaments and transitive digraphs.

Keywords: k-Quasi-transitive digraph; Quasi-transitive digraph; Hamiltonian cycle; Hamiltonicity; Pancyclicity (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321004082
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:408:y:2021:i:c:s0096300321004082

DOI: 10.1016/j.amc.2021.126319

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().