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...

Full description

Saved in:
Bibliographic Details
Published in:Discrete dynamics in nature and society 2018-01, Vol.2018 (2018), p.1-15
Main Authors: Karaaslan, Faruk, Ali, M. I., Cao, Bing-Yuan, Hayat, Khizar, Qin, Zejian
Format: Article
Language:English
Subjects:
Applied mathematics
Computers
Decision analysis
Decision making
Graph theory
Graphs
Neighborhoods
Parameters
Set theory
Trees (mathematics)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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
DOI:10.1155/2018/8535703