(Strong) Proper Connection in Some Digraphs
An arc-colored digraph D is proper connected if any pair of vertices vi, vj ε V(D) there is a proper vi - vj path whose adjacent arcs have different colors and a proper vj - vi path whose adjacent arcs have different colors. The proper connection number of a digraph D is the minimum numbe...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8720152/ |