Strong rainbow edge colouring and graph decomposition (original) (raw)

2016 Online International Conference on Green Engineering and Technologies (IC-GET), 2016

Abstract

Decompositions play a vital role in graph theory. It provides an efficient method to partition the edges of Gso that the results for complicated graphs can be achieved by means of its subgraphs. We show how to find the minimum number of colours required in an edge colouring of a connected graphGin which every pair of vertices is connected by at least one shortest path in which no two edges are coloured the same using subgraph decomposition. In this paper, we compute the strong rainbow edge-connection number using A-decomposition for some classes of snake graphs and Sierpinski triangle graph.

Annammal Arputhamary hasn't uploaded this paper.

Create a free Academia account to let Annammal know you want this paper to be uploaded.

Ask for this paper to be uploaded.