Abstract

Let G be a nontrivial edge-colored connected graph. A rainbow edge-cut is an edge-cut R of G, and all edges of R have different colors in G. For two different vertices u and v of G, a u-v-edge-cut is an edge-cut separating them. An edge-colored graph G is called strong rainbow disconnected if for every two distinct vertices u and v of G, there exists a both rainbow and minimum u-v-edge-cut in G, and such an edge-coloring is called a strong rainbow disconnection coloring (srd-coloring for short) of G. For a connected graph G, the strong rainbow disconnection number (srd-number for short) of G, denoted by srd(G), is the minimum number of colors required to make G strong rainbow disconnected. In this paper, we first characterize the graphs with m edges satisfing srd(G) = k for each k ∈ {1, 2, m}, respectively, and we also show that the srd-number of a nontrivial connected graph G is equal to the maximum srd-number in the blocks of G. Secondly, we study the srd-numbers for the complete k-partite graphs, k-edge-connected k-regular graphs and grid graphs. Finally, we prove that for a connected graph G, computing srd(G) is NP-hard. In particular, we prove that it is NP-complete to decide if srd(G) = 3 for a connected cubic graph. We also show that the following problem is NP-complete: given an edge-colored (with an unbounded number of colors) connected graph G, check whether the given coloring makes G strong rainbow disconnected.

Highlights

  • All graphs considered in this paper are simple, finite and undirected

  • We first characterize the graphs with m edges such that srd(G) = k for each k ∈ {1, 2, m}, respectively, and we show that the srdnumber of a nontrivial connected graph G equals the maximum srd-number among the blocks of G

  • We show that for a given edge-colored connected graph G it is NP-complete to decide whether G is strong rainbow disconnected

Read more

Summary

Introduction

All graphs considered in this paper are simple, finite and undirected. Let G = (V (G), E(G)) be a nontrivial connected graph with vertex-set V (G) and edge-set E(G). An edge-colored graph G is called rainbow disconnected if for every two distinct vertices u and v of G, there exists a rainbow u-v-edge-cut in G, separating them. An edge-colored graph G is called strong rainbow disconnected if for every two distinct vertices u and v of G, there exists a both rainbow and minimum u-v-edgecut (rainbow minimum u-v-edge-cut for short) in G, separating them. In this case, the edge-coloring is called a strong rainbow disconnection coloring (srd-coloring for short) of G. For a connected graph G, we define the strong rainbow disconnection number (srd-number for short) of G, denoted by srd(G), as the smallest number of colors that are needed in order to make G strong rainbow disconnected. We show that for a given edge-colored (with an unbounded number of colors) connected graph G it is NP-complete to decide whether G is strong rainbow disconnected

Some basic results
The srd-numbers of some classes of graphs
Hardness results
Concluding remarks
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call