Soft Bipartite Graph: A New Bipartite Graph in the Horizon

Main Article Content

Supriya M D
P Usha

Abstract

In order to discuss uncertainty in soft graphs, a new graph valued function called the Soft Bipartite graph is introduced in this paper. Let ???? = {????1,????2,????3,...,????????} be a non-empty set, ????1 = {????1,????2,????3,...,????????} and ????2 = {????1,????2,????3,...,????????} be two partitions of ????, where ???????? ⊆ ????(???? = 1,2,...,????) and ???? ⊆ ????(???? = 1,2,...,????). The Soft bipartite graph, ???? is a bipartite graph with ????(???? }) = ???? ∪ ???? ???? ???????? ???????? 1 2 and any two vertices ???????? ∈ ????1and ???????? ∈ ????2 are adjacent if and only if ???????? ∩ ???????? ≠ ∅. Several basic properties of this newly defined graph are investigated. We also present an application of this concept in the decision-making problem.

Article Details

Section
Articles