# Search results for: Xueliang Li

Results in Mathematics > 2017 > 72 > 4 > 2079-2100

*total-colored*if all the edges and the vertices of the graph are colored. A total-colored graph is

*total-rainbow connected*if any two vertices of the graph are connected by a path whose edges and internal vertices have distinct colors. For a connected graph

*G*, the

*total-rainbow connection number*of

*G*, denoted by

*trc*(

*G*), is the minimum number of colors required in a total-coloring...

Bulletin of the Malaysian Mathematical Sciences Society > 2019 > 42 > 1 > 381-390

*P*in a total-colored graph

*G*is called a total-proper path if (1) any two adjacent edges of

*P*are assigned distinct colors; (2) any two adjacent internal vertices of

*P*are assigned distinct colors; and (3) any internal vertex of

*P*is assigned a distinct color from its incident edges of

*P*. The total-colored...

Discrete Applied Mathematics > 2015 > 185 > Complete > 102-112