A New Type-2 Soft Set: Type-2 Soft Graphs and Their Applications
The correspondence between a vertex and its neighbors has an essential role in the structure of a graph. Type-2 soft sets are also based on the correspondence of primary parameters and underlying parameters. In this study, we present an application of type-2 soft sets in graph theory. We introduce v...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-01-01
|
| Series: | Advances in Fuzzy Systems |
| Online Access: | http://dx.doi.org/10.1155/2017/6162753 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The correspondence between a vertex and its neighbors has an essential role in the structure of a graph. Type-2 soft sets are also based on the correspondence of primary parameters and underlying parameters. In this study, we present an application of type-2 soft sets in graph theory. We introduce vertex-neighbors based type-2 soft sets over X (set of all vertices of a graph) and E (set of all edges of a graph). Moreover, we introduce some type-2 soft operations in graphs by presenting several examples to demonstrate these new concepts. Finally, we describe an application of type-2 soft graphs in communication networks and present procedure as an algorithm. |
|---|---|
| ISSN: | 1687-7101 1687-711X |