A Structural Study of Km1,m2,…,mrj1,j2,…,jr Classes in Complete Soft Semigraphs

Soft set theory offers a structured method for managing imprecision and uncertainty by classifying elements of a set according to particular parameters. In the realm of semigraph theory, soft semigraphs apply this method, providing a parameterised viewpoint that has notably advanced the field by facilitating efficient parameter management. In this paper, we delve into an in-depth analysis of complete soft semigraphs in the form [Formula: see text]. Key properties such as the total number of [Formula: see text]-edges and various vertex degrees are examined through a series of theorems, providing valuable insights into the complex relationships and characteristics of these soft semigraphs.