Vertex-Pancyclism in the Generalized Sum of Digraphs
Abstract
A digraph , of order is pancyclic, whenever contains a directed cycle of length for each ; and is vertex-pancyclic iff, for each vertex and each , contains a directed cycle of length passing through . Let be a collection of pairwise vertex disjoint digraphs. The generalized sum (g.s.) of , denoted by or , is the set of all digraphs satisfying: (i) , (ii) for , and (iii) for each pair of vertices belonging to different summands of , there is exactly one arc between them, with an arbitrary but fixed direction. A digraph in will be called a generalized sum (g.s.) of . Let be a collection of pairwise vertex disjoint Hamiltonian digraphs, in this paper we give simple sufficient conditions for a digraph be vertex-pancyclic. This result extends a result obtained by Cordero-Michel, Galeana-S\'anchez and Goldfeder in 2016.
Keywords
Cite
@article{arxiv.2011.01886,
title = {Vertex-Pancyclism in the Generalized Sum of Digraphs},
author = {N. Cordero-Michel and H. Galeana-Sánchez},
journal= {arXiv preprint arXiv:2011.01886},
year = {2020}
}
Comments
13 pages, 5 figures