A note on Mycielskian type of a graph
Chandrashekar Adiga, Bayad, Abdelmejid, A. S. Shrikanth · MyPrints@UOM (Mysore University Library) · 2012
In this paper we introduce and study an interesting graph transformation which we call the Mycielskian type graph of a graph. We show that MT(G), the Mycielskian type graph of a graph G has no k-fall coloring for any k≥2. We also compute the spectrum of Mycielskian type graph of a k-regular graph G. Friendly index sets of Mycielskian type graphs of Pn and Cn are determined