  In a search for triangle-free graphs with arbitrarily large chromatic
numbers, Mycielski developed a graph transformation that transforms a graph
into a new graph which is called the Mycielskian of that graph. In this paper
we provide some sharp bounds for the Randic index of the Mycielskian graphs.
Also, we determine the degree distance index of the Mycielskian of each graph
with diameter two.
