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!
|
| _version_ | 1832549027622682624 |
|---|---|
| author | Khizar Hayat Bing-Yuan Cao Muhammad Irfan Ali Faruk Karaaslan Zejian Qin |
| author_facet | Khizar Hayat Bing-Yuan Cao Muhammad Irfan Ali Faruk Karaaslan Zejian Qin |
| author_sort | Khizar Hayat |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-5124ff981a3343a3b01b60bfbc4eadf2 |
| institution | Kabale University |
| issn | 1026-0226 1607-887X |
| language | English |
| publishDate | 2018-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-5124ff981a3343a3b01b60bfbc4eadf22025-02-03T06:12:28ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2018-01-01201810.1155/2018/85357038535703Characterizations of Certain Types of Type 2 Soft GraphsKhizar Hayat0Bing-Yuan Cao1Muhammad Irfan Ali2Faruk Karaaslan3Zejian Qin4School of Mathematics and Information Sciences, Guangzhou University, 510000 Guangzhou, ChinaSchool of Mathematics and Information Sciences, Guangzhou University, 510000 Guangzhou, ChinaDepartment of Mathematics, Islamabad Model College for Girls, F-6/2, Islamabad, PakistanDepartment of Mathematics, Faculty of Sciences, ankr Karatekin University, 18100 ankr, TurkeySchool of Mathematics and Information Sciences, Guangzhou University, 510000 Guangzhou, ChinaThe 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.http://dx.doi.org/10.1155/2018/8535703 |
| spellingShingle | Khizar Hayat Bing-Yuan Cao Muhammad Irfan Ali Faruk Karaaslan Zejian Qin Characterizations of Certain Types of Type 2 Soft Graphs Discrete Dynamics in Nature and Society |
| title | Characterizations of Certain Types of Type 2 Soft Graphs |
| title_full | Characterizations of Certain Types of Type 2 Soft Graphs |
| title_fullStr | Characterizations of Certain Types of Type 2 Soft Graphs |
| title_full_unstemmed | Characterizations of Certain Types of Type 2 Soft Graphs |
| title_short | Characterizations of Certain Types of Type 2 Soft Graphs |
| title_sort | characterizations of certain types of type 2 soft graphs |
| url | http://dx.doi.org/10.1155/2018/8535703 |
| work_keys_str_mv | AT khizarhayat characterizationsofcertaintypesoftype2softgraphs AT bingyuancao characterizationsofcertaintypesoftype2softgraphs AT muhammadirfanali characterizationsofcertaintypesoftype2softgraphs AT farukkaraaslan characterizationsofcertaintypesoftype2softgraphs AT zejianqin characterizationsofcertaintypesoftype2softgraphs |