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...
Guardado en:
Autores principales: | Li Ruijuan, Cao Yanqin, Zhang Xinhong |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
De Gruyter
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/f3ab52f3569c406c930f0de214d8f182 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Rainbow neighbourhood number of graphs
por: Kok,Johan, et al.
Publicado: (2019) -
The (1, 2)-step competition graph of a hypertournament
por: Li Ruijuan, et al.
Publicado: (2021) -
Banhatti, revan and hyper-indices of silicon carbide Si2C3-III[n,m]
por: Zhao Dongming, et al.
Publicado: (2021) -
Hosoya properties of the commuting graph associated with the group of symmetries
por: Abbas Ghulam, et al.
Publicado: (2021) -
Path homology theory of edge-colored graphs
por: Muranov Yuri V., et al.
Publicado: (2021)