Vertex-Pancyclism in the Generalized Sum of Digraphs

Abstract

A digraph D=(V(D), A(D)) of order n≥ 3 is pancyclic, whenever D contains a directed cycle of length k for each k∈ \3,…,n\; and D is vertex-pancyclic iff, for each vertex v∈ V(D) and each k∈ \3,…,n\, D contains a directed cycle of length k passing through v. Let D1, D2, …, Dk be a collection of pairwise vertex disjoint digraphs. The generalized sum (g.s.) of D1, D2, …, Dk, denoted by i=1k Di or D1 D2 ·s Dk, is the set of all digraphs D satisfying: (i) V(D)=i=1k V(Di), (ii) D V(Di) Di for i=1,2,…, k, and (iii) for each pair of vertices belonging to different summands of D, there is exactly one arc between them, with an arbitrary but fixed direction. A digraph D in i=1k Di will be called a generalized sum (g.s.) of D1, D2, …, Dk. Let D1, D2, …, Dk be a collection of k pairwise vertex disjoint Hamiltonian digraphs, in this paper we give simple sufficient conditions for a digraph D∈ i=1k Di be vertex-pancyclic. This result extends a result obtained by Cordero-Michel, Galeana-S\'anchez and Goldfeder in 2016.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…