Characterizations of Certain Types of Type 2 Soft Graphs
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...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2018/8535703 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1026-0226 1607-887X |