IJPAM: Volume 112, No. 1 (2017)

Title

STRONG RAINBOW EDGE-COLOURING OF
VARIANTS OF CUBIC HALIN GRAPHS

Authors

I. Annammal Arputhamary$^1$, M. Helda Mercy$^2$
$^1$Sathyabama University
Chennai, 119, INDIA
$^2$Panimalar Engineering College
Chennai, 123, INDIA

Abstract

A non trivial connected graph $G=(V,E)$ is strongly rainbow connected if every two vertices $u$ and $v$ of $G$ are connected by at least one shortest $u-v$ path in which no two edges have same colours. The strong rainbow connection number of $G$, denoted by $src(G)$ is the minimum number of colours that makes $G$ strongly rainbow connected. In this paper we explore the strong rainbow connection number of variants of cubic Halin graphs.

History

Received: June 3, 2016
Revised: November 11, 2016
Published: January 26, 2017

AMS Classification, Key Words

AMS Subject Classification: 05C15, 05C40
Key Words and Phrases: diameter, strong rainbow edge colouring, cubic Halin graph

Download Section

Download paper from here.
You will need Adobe Acrobat reader. For more information and free download of the reader, see the Adobe Acrobat website.

Bibliography

1
S. Chakraborty, E. Fischer, A. Matsliah, R. Yuster, Hardness and algorithms for rainbow connection, Journal of Combinatorics Optimization (2009), 1-18.

2
G. Chartrand, G. Johns, K. McKeon, P. Zhang, Rainbow Connection in Graphs, Math. Bohem, 133(1) (2008), 85-98.

3
M. Krivelvich, R. Yuster, The rainbow connection of a graph is (atmost) reciprocal to its minimum degree, J. Graph Theory, 63 (2009), 185-91.

4
X. Li, Y. Shi, On the rainbow vertex-connection, ArXiv: 1012.3504[math.CO] (2010).

5
W.C. Shiu, P.C.B. Lam, W.K. Tam, On strong chromatic index of Halin graphs, J. Combin. Math. Combin. Comput., 57 (2006), 211-222.

How to Cite?

DOI: 10.12732/ijpam.v112i1.5 How to cite this paper?

Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2017
Volume: 112
Issue: 1
Pages: 71 - 80


Google Scholar; DOI (International DOI Foundation); WorldCAT.

CC BY This work is licensed under the Creative Commons Attribution International License (CC BY).