The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and
Zhang in 2008. Nowadays it has become a new and active subject in graph theory. There is …

Given a graph with colors on its vertices, a path is called a rainbow vertex path if all its
internal vertices have distinct colors. We say that the graph is rainbow vertex-connected if …

An edge-colored graph G is said to be rainbow connected if between each pair of vertices
there exists a path which uses each color at most once. The rainbow connection number …

We study rainbow connectivity of graphs from the algorithmic and graph-theoretic points of
view. The study is divided into three parts. First, we study the complexity of deciding whether …

A well-studied coloring problem is to assign colors to the edges of a graph G so that, for
every pair of vertices, all edges of at least one shortest path between them receive different …

The concept of rainbow connection was introduced by Chartrand et al. in 2008. The k-
rainbow index, which is a generalization of rainbow connection number was also introduced …

We present an integer programming model to compute the strong rainbow connection
number, src (G), of any simple graph G. We introduce several enhancements to the …

We look at some graph problems related to covering, partition, and connectivity. First, we
study the problems of covering and partitioning edges with bicliques, especially from the …

This thesis details efforts made to perform system identification and control of aircraft using a
self-assembling radial basis neural network method. First, Sequential Function …

This thesis exhibits a collection of combinatorial optimization problems and the integer
programs proposed to solve them based on new mathematical insights. In particular, graph …