A graph G with acyclic coloring has no two adjacent vertices with the same color and no bichromatic cycle. Also, the coloring results in a forest when any two-color classes are combined. The concept of acyclic coloring plays a pivotal role in the computation of Hessians, Kekule structures classification, coding theory, and statistical mechanics. In this paper, the acyclic chromatic number of generalized fan graph, generalized Möbius ladder graph and flower snark graph have been determined.

No abstract

Matrices have various applications, one of them being rotating or flipping a picture. A flipped image is required while printing images on a surface, designing circuits and taking selfies in a mobile phone. Otherwise, the original image will remain as a mirror image. Here, we have used a simple python program which corrects the mirror image with the help of matrix row operation and transpose of a matrix.