(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: | Yingbin Ma, Kairui Nie |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8720152/ |
Similar Items
-
Graphs with Strong Proper Connection Numbers and Large Cliques
by: Yingbin Ma, et al.
Published: (2023-04-01) -
Properly Colored Notions of Connectivity - A Dynamic Survey
by: Xueliang Li, et al.
Published: (2015-01-01) -
Some results on the total proper k-connection number
by: Ma Yingbin, et al.
Published: (2022-04-01) -
Characterizations of Graphs Having Large Proper Connection Numbers
by: Lumduanhom Chira, et al.
Published: (2016-05-01) -
Proper Connection Of Direct Products
by: Hammack Richard H., et al.
Published: (2017-11-01)