Graph burning is a deterministic discrete time graph process that can be interpreted as a model for the spread of influence in social networks. The burning number of a graph is the minimum number of steps in a graph burning process for that graph. In this paper, we consider the burning number of graph products. We find some general bounds on the burning number of the Cartesian product and the s...

There are four standard products of graphs: the direct product, the Cartesian product, the strong product and the lexicographic product. The chromatic number turned out to be an interesting parameter on all these products, except on the Cartesian one. A survey is given on the results concerning the chromatic number of the three relevant products. Some applications of product colorings are also ...

In this paper, we study depth and Stanley of the edge ideals quotient rings ideals, associated with classes graphs obtained by strong product two graphs. We consider cases when either both are arbitrary paths or one is an path other cycle. give exact formula for values some subclasses. also sharp upper bounds in general cases.

Background and objectives: Pelargonium graveolens L'Hér. is an essential oil bearing plant used in traditional medicine of Iran for the treatment of inflammatory disease and pain, anxiety, sadness and also for the relief of gastrointestinal symptoms. Its pharmaceutical product is presently used in Iran for the treatment of depression disorders. Since colitis is a brain...