The vertex-neighbors correspondence has an essential role in the structure of a graph. The type 2 soft set is also based on the correspondence of initial parameters and underlying parameters. Recently, type 2 soft graphs have been introduced. Structurally, it is a very efficient model of uncertainty to deal with graph neighbors and applicable in applied intelligence, computational analysis, and decision-making. The present paper characterizes type 2 soft graphs on underlying subgraphs (regular subgraphs, irregular subgraphs, cycles, and trees) of a simple graph. We present regular type 2 soft graphs, irregular type 2 soft graphs, and type 2 soft trees. Moreover, we introduce type 2 soft cycles, type 2 soft cut-nodes, and type 2 soft bridges. Finally, we present some operations on type 2 soft trees by presenting several examples to demonstrate these new concepts.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.