Rainbow connection in some digraphs

Research paper by Jesús Alva-Samos, Juan José Montellano-Ballesteros

Indexed on: 07 Apr '15Published on: 07 Apr '15Published in: Mathematics - Combinatorics

Abstract

An edge-coloured graph $G$ is {\it rainbow connected} if any two vertices are connected by a path whose edges have distinct colours. This concept was introduced by Chartrand et al. in \cite{ch01}, and it was extended to oriented graphs by Dorbec et al. in \cite{DI}. In this paper we present some results regarding this extention, mostly for the case of circulant digraphs.

Rainbow connection in some digraphs

Abstract

More like this:

Certain classes of bi-univalent functions related to Shell-like curves connected with Fibonacci numbers

Comment on "Search for Muon Neutrino Oscillations with the Irvine-Michigan-Brookhaven Detector"

Reply to the Comment by Galanakis \textit{et al} on the paper \textquotedblleft Exact bosonization for an interacting Fermi gas in arbitrary dimensions"

Rainbow connection in some digraphs

Abstract

More like this:

Certain classes of bi-univalent functions related to Shell-like curves connected with Fibonacci numbers

Comment on "Search for Muon Neutrino Oscillations with the Irvine-Michigan-Brookhaven Detector"

Reply to the Comment by Galanakis \textit{et al} on the paper \textquotedblleft Exact bosonization for an interacting Fermi gas in arbitrary dimensions"

This website uses cookies