On kernels by rainbow paths in arc-coloured digraphs
In 2018, Bai, Fujita and Zhang [Discrete Math. 341 (2018), no. 6, 1523–1533] introduced the concept of a kernel by rainbow paths (for short, RP-kernel) of an arc-coloured digraph DD, which is a subset SS of vertices of DD such that (aa) there exists no rainbow path for any pair of distinct vertices...
Saved in:
Main Authors: | Li Ruijuan, Cao Yanqin, Zhang Xinhong |
---|---|
Format: | article |
Language: | EN |
Published: |
De Gruyter
2021
|
Subjects: | |
Online Access: | https://doaj.org/article/f3ab52f3569c406c930f0de214d8f182 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Rainbow neighbourhood number of graphs
by: Kok,Johan, et al.
Published: (2019) -
The (1, 2)-step competition graph of a hypertournament
by: Li Ruijuan, et al.
Published: (2021) -
Banhatti, revan and hyper-indices of silicon carbide Si2C3-III[n,m]
by: Zhao Dongming, et al.
Published: (2021) -
Hosoya properties of the commuting graph associated with the group of symmetries
by: Abbas Ghulam, et al.
Published: (2021) -
Path homology theory of edge-colored graphs
by: Muranov Yuri V., et al.
Published: (2021)