JAYANTA BERA

Mr. JAYANTA BERA


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 April 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
JBJAYANTA BERA
JAYANTA BERA
Kinkar Chandra DasKinkar Chandra Das
Kinkar Chandra Das
Sovan  SamantaSovan Samanta
Sovan Samanta
JLJeong-Gon Lee
Jeong-Gon Lee
Intuitionistic fuzzy graph theory is used to represent ambiguous networks, such as financial and social networks. The connectivity of such networks has a significant role in analyzing the network characteristics. This study investigates the connectivity status of vertices in an intuitionistic fuzzy graph. Few properties have been established. Some areas of applications are shown for merging different banks and finding the central affected nodes by any infectious diseases.

22 August 2025 in International Journal of Quantum Chemistry
Verified
Journal Article
Closed access
Kinkar Chandra DasKinkar Chandra Das
Kinkar Chandra Das
MAManar Alharbi
Manar Alharbi
JBJAYANTA BERA
JAYANTA BERA

1 September 2026 in Journal of Applied Mathematics and Computing
Verified
Journal Article
Closed access
PDF file
Kinkar Chandra DasKinkar Chandra Das
Kinkar Chandra Das
JBJAYANTA BERA
JAYANTA BERA

11 June 2026 in RAIRO - Operations Research
Verified
Journal Article
Open access
SLSeungjae Lee
Seungjae Lee
JBJAYANTA BERA
JAYANTA BERA
Kinkar Chandra DasKinkar Chandra Das
Kinkar Chandra Das
Sovan  SamantaSovan Samanta
Sovan Samanta
JMJunwon Moon
Junwon Moon
TATofigh Allahviranloo
Tofigh Allahviranloo
Fuzzy graph theory is a rapidly developing area of research with numerous applications across various fields, such as communication networks, hospital networks, transportation systems, decision-making, and optimization problems. In recent years, bipolar intuitionistic fuzzy networks have emerged as an effective framework for modelling complex human decision-making processes. \rev{In this paper, the concepts of connectivity status (CS) and average edge connectivity (AEC) on bipolar intuitionistic fuzzy graphs (BIFGs) are introduced to enhance network analysis by incorporating both positive and negative membership and non-membership values. This approach provides a more accurate understanding of network dynamics. A novel algorithm for computing the CS on BIFGs is proposed, achieving substantially lower time complexity compared to existing algorithms for CS. In addition, an algorithm for computing AEC on BIFGs is presented. Several theorems concerning CS and AEC are established. To demonstrate practical utility, the proposed methods are applied to hospital networks. Furthermore, the optimal path on BIFGs is defined and its application in transportation systems is illustrated.