On the Sombor Index of Sierpinski and Mycielskian Graphs

In 2020, mathematical chemist, Ivan Gutman, introduced a new vertex-degree-based topological index called the Sombor Index, denoted by SO (G), where G is a simple, connected, finite, graph. This paper aims to present some novel formulas, along with some upper and lower bounds on the Sombor Index of generalized Sierpinski graphs; originally defined by Klavzar and Milutinovic by replacing the complete graph appearing in S (n, k) with any graph and exactly replicating the same graph, yielding self-similar graphs of fractal nature; and on the Sombor Index of the m-Mycielskian or the generalized Mycielski graph; formed from an interesting construction given by Jan Mycielski (1955); of some simple graphs such as K-n, C-n(2), C-n, and P-n. We also provide Python codes to verify the results for the SO (S (n, K-m)) and SO (mu(m) (K-n)).