English

Vertex-Pancyclism in the Generalized Sum of Digraphs

Combinatorics 2020-11-04 v1

Abstract

A digraph D=(V(D)D=(V(D), A(D))A(D)) of order n3n\geq 3 is pancyclic, whenever DD contains a directed cycle of length kk for each k{3,,n}k\in \{3,\ldots,n\}; and DD is vertex-pancyclic iff, for each vertex vV(D)v\in V(D) and each k{3,,n}k\in \{3,\ldots,n\}, DD contains a directed cycle of length kk passing through vv. Let D1,D2,,DkD_1, D_2, \ldots, D_k be a collection of pairwise vertex disjoint digraphs. The generalized sum (g.s.) of D1,D2,,DkD_1, D_2, \ldots, D_k, denoted by i=1kDi\oplus_{i=1}^k D_i or D1D2DkD_1\oplus D_2 \oplus \cdots \oplus D_k, is the set of all digraphs DD satisfying: (i) V(D)=i=1kV(Di)V(D)=\bigcup_{i=1}^k V(D_i), (ii) DV(Di)DiD\langle V(D_i) \rangle \cong D_i for i=1,2,,ki=1,2,\ldots, k, and (iii) for each pair of vertices belonging to different summands of DD, there is exactly one arc between them, with an arbitrary but fixed direction. A digraph DD in i=1kDi\oplus_{i=1}^k D_i will be called a generalized sum (g.s.) of D1,D2,,DkD_1, D_2, \ldots, D_k. Let D1,D2,,DkD_1, D_2, \ldots, D_k be a collection of kk pairwise vertex disjoint Hamiltonian digraphs, in this paper we give simple sufficient conditions for a digraph Di=1kDiD\in \oplus_{i=1}^k D_i 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

R2 v1 2026-06-23T19:53:36.568Z