Total Rainbow Connection Number of Some Graph Operations
In a graph <i>H</i> with a total coloring, a path <i>Q</i> is a total rainbow if all elements in <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>V</mi><mo>(<...
Main Authors: | Hengzhe Li, Yingbin Ma, Yan Zhao |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-05-01
|
Series: | Axioms |
Subjects: | |
Online Access: | https://www.mdpi.com/2075-1680/11/6/254 |
Similar Items
-
The Vertex-Rainbow Connection Number of Some Graph Operations
by: Li Hengzhe, et al.
Published: (2021-05-01) -
Rainbow connections of bioriented graphs
by: Linlin Wang, et al.
Published: (2024-05-01) -
Rainbow Connection Number of Dense Graphs
by: Li Xueliang, et al.
Published: (2013-07-01) -
Hardness Results for Total Rainbow Connection of Graphs
by: Chen Lily, et al.
Published: (2016-05-01) -
An updated survey on rainbow connections of graphs - a dynamic survey
by: Xueliang Li, et al.
Published: (2017-01-01)