Characterizations of Certain Types of Type 2 Soft Graphs

Khizar Hayat, Bing-Yuan Cao, Muhammad Irfan Ali, Faruk Karaaslan and Zejian Qin

Discrete Dynamics in Nature and Society, 2018, vol. 2018, 1-15

Abstract:

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.

Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2018/8535703.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2018/8535703.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:8535703

DOI: 10.1155/2018/8535703

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().