An Algorithmic Approach to Bridge Detection in Bijective Neutrosophic Graph with Application in Cancer Diagnosis

Authors

  • D.Rajalaxmi PG and Research Department of Mathematics, Seethalakshmi Ramaswami College, Tiruchirappalli,(Affiliated to Bharathidasan University, Tiruchirappalli), India.
  • V.Vijaya PG and Research Department of Mathematics, Seethalakshmi Ramaswami College, Tiruchirappalli,(Affiliated to Bharathidasan University, Tiruchirappalli), India.
  • S.Revath Department of Mathematics, Saranathan College of Engineering, Tiruchirappalli, India

Keywords:

Neutrosophic Graph; Bijective Neutrosophic graph; T-bridge, I-bridge, F bridge; and Neutrosophic Bridge.

Abstract

This paper introduces an efficient algorithm for detecting bridges in Bijective 
neutrosophic graphs, an emerging approach in handling uncertainty in complex systems such 
as medical diagnostics. The algorithm identifies T-bridges, I- bridges and F-bridges in 
neutrosophic graphs, and incorporates a de neutrosophication method using score function to 
find neutrosophic bridges when needed. The application of the algorithm to cancer diagnosis 
is explored, demonstrating its potential to enhance disease identification and treatment 
planning based on symptoms. The result suggest that this method can improve the accuracy 
of medical decision- making in uncertain environments, thereby offering a promising tool for 
healthcare analysis. By providing a more precise understanding of medical data, this 
approach has the potential to optimize diagnostic processes and treatment strategies in 
uncertain and indeterminate contexts.  

 

DOI 10.5281/zenodo.17335289

Downloads

Download data is not yet available.

Downloads

Published

2026-02-25

How to Cite

D.Rajalaxmi, V.Vijaya, & S.Revath. (2026). An Algorithmic Approach to Bridge Detection in Bijective Neutrosophic Graph with Application in Cancer Diagnosis. Neutrosophic Sets and Systems, 96, 284-298. https://fs.unm.edu/nss8/index.php/111/article/view/7270