Many symmetric properties are well-explored in graph theory, especially coloring, such as graphs defined by the automorphism groups, drawing of planar graphs, and functions which used to count number specific colorings a graph. This paper is devoted studying star edge coloring 1-planar graphs. The chromatic index χst′(G) G smallest k for edges can be colored using colors so that no two adjacent...

A Steiner triple system of order v, denoted STS (v), is a pair (V, B); V is a u-set of elements and B is a collection of 3-subsets of V called blocks. Each unordered pair of elements is contained in precisely one block. There is a substantial body of research on STS, partially because of their wide applicability in the design of experiments, and in the theory of error-correcting codes. In the d...