Investigating the traits of soft semigraph-associated degrees

Abstract

Soft set theory, introduced by D. Molodtsov, is a mathematical approach that tackles uncertain data. Semigraph is a generalization of the concept of a graph. By incorporating soft sets into semigraphs, a new concept called soft semigraphs has emerged. The study of soft semigraphs has gained significance in graph theory due to their valuable applications in parametrization. This paper explores the properties of various vertex degrees in soft semigraphs, including degrees, end degrees, edge degrees, adjacent degrees, and consecutive adjacent degrees.