a graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. in this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.

in this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.

A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

in this paper we investigate the green‎ ‎graphs for the regular and inverse semigroups by considering the‎ ‎green classes of them‎. ‎and by using the properties of these‎ ‎semigroups‎, ‎we prove that all of the five green graphs for the‎ ‎inverse semigroups are isomorphic complete graphs‎, ‎while this‎ ‎doesn't hold for the regular semigroups‎. ‎in other words‎, ‎we prove‎ ‎that in a regular se...

In this paper we investigate the Green‎ ‎graphs for the regular and inverse semigroups by considering the‎ ‎Green classes of them‎. ‎And by using the properties of these‎ ‎semigroups‎, ‎we prove that all of the five Green graphs for the‎ ‎inverse semigroups are isomorphic complete graphs‎, ‎while this‎ ‎doesn't hold for the regular semigroups‎. ‎In other words‎, ‎we prove‎ ‎that in a regular se...