No abstract

No abstract

A strict strong coloring of a graph [Formula: see text] is a proper coloring of [Formula: see text] in which every vertex of the graph is adjacent to every vertex of some color class. The minimum number of colors required for a strict strong coloring of [Formula: see text] is called the strict strong chromatic number of [Formula: see text] and is denoted by [Formula: see text]. In this paper, we characterize the results on strict strong coloring of Mycielskian graphs and iterated Mycielskian graphs.

No abstract

In this paper, we propose new technique for solving time fractional gas dynamics equation using Laplace-Adomian Decomposition method coupled with fractional complex transform. It is found that the tested examples reveal the present method is more reliable and does not require strong assumptions.