Corona products and rooted products of soft graphs

Soft set theory is a broad mathematical method for handling uncertain data. Numerous scholars are now using soft set theory to address problems related to decision-making. The concept of soft graphs provides a parameterized point of view for graphs. In graph theory, graph products are binary operations on graphs with various combinatorial purposes. We can define product operations of soft graphs in a manner similar to how graph products are defined. In this paper, we introduce the corona product, the restricted corona product, the rooted product, and the restricted rooted product of soft graphs. We prove that these products of soft graphs are again soft graphs. We also derive methods for computing their vertex count, edge count, and the sum of part degrees.