Xiaolong Huang ; Hengzhe Li ; Xueliang Li ; Yuefang Sun - Oriented diameter and rainbow connection number of a graph

dmtcs:2093 - Discrete Mathematics & Theoretical Computer Science, June 19, 2014, Vol. 16 no. 3 - https://doi.org/10.46298/dmtcs.2093
Oriented diameter and rainbow connection number of a graph

Authors: Xiaolong Huang 1; Hengzhe Li 2,1; Xueliang Li 1; Yuefang Sun ORCID-iD1

  • 1 Center for Combinatorics [Nankai]
  • 2 College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, China

The oriented diameter of a bridgeless graph G is min diam(H) | H is a strang orientation of G. A path in an edge-colored graph G, where adjacent edges may have the same color, is called rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer number k for which there exists a k-edge-coloring of G such that every two distinct vertices of G are connected by a rainbow path. In this paper, we obtain upper bounds for the oriented diameter and the rainbow connection number of a graph in terms of rad(G) and η(G), where rad(G) is the radius of G and η(G) is the smallest integer number such that every edge of G is contained in a cycle of length at most η(G). We also obtain constant bounds of the oriented diameter and the rainbow connection number for a (bipartite) graph G in terms of the minimum degree of G.

Volume: Vol. 16 no. 3
Section: Graph Theory
Published on: June 19, 2014
Submitted on: December 23, 2012
Keywords: Diameter,Radius,Oriented diameter,Rainbow connection number,Cycle length,Bipartite graph,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo ARXIV 0902.1255
Source : ScholeXplorer IsRelatedTo DOI 10.4230/lipics.stacs.2009.1811
Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.0902.1255
  • 0902.1255
  • 10.48550/arxiv.0902.1255
  • 10.4230/lipics.stacs.2009.1811
Hardness and Algorithms for Rainbow Connectivity

1 Document citing this article

Consultation statistics

This page has been seen 315 times.
This article's PDF has been downloaded 557 times.