Proper connection and proper-walk connection of digraphs

Anna Fiedorowicz, Elżbieta Sidorowicz and Éric Sopena

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

Abstract: An arc-colored digraph D is properly (properly-walk) connected if, for any ordered pair of vertices (u,v), the digraph D contains a directed path (a directed walk) from u to v such that arcs adjacent on that path (on that walk) have distinct colors. The proper connection number pc→(D) (the proper-walk connection number wc→(D)) of a digraph D is the minimum number of colours to make D properly connected (properly-walk connected). We prove that pc→(Cn(S))≤2 for every circulant digraph Cn(S) with S⊆{1,…,n−1},|S|≥2 and 1∈S. Furthermore, we give some sufficient conditions for a Hamiltonian digraph D to satisfy pc→(D)=wc→(D)=2.

Keywords: Proper connection; Digraph; Arc colouring (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630032100343X
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:410:y:2021:i:c:s009630032100343x

DOI: 10.1016/j.amc.2021.126253

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 ().