Shortest path problem using Bellman algorithm under neutrosophic environment S Broumi, A Dey, M Talea, A Bakali, F Smarandache, D Nagarajan, ... Complex & intelligent systems 5 (4), 409-416, 2019 | 88 | 2019 |

Neutrosophic shortest path problem R Kumar, SA Edaltpanah, S Jha, S Broumi, A Dey Infinite Study, 2018 | 83 | 2018 |

A multi objective programming approach to solve integer valued neutrosophic shortest path problems R Kumar, SA Edalatpanah, S Jha, S Broumi, R Singh, A Dey Infinite Study, 2019 | 64 | 2019 |

Interval type 2 fuzzy set in fuzzy shortest path problem A Dey, A Pal, T Pal Mathematics 4 (4), 62, 2016 | 54 | 2016 |

New concepts of picture fuzzy graphs with application C Zuo, A Pal, A Dey Mathematics 7 (5), 470, 2019 | 50 | 2019 |

A genetic algorithm for solving fuzzy shortest path problems with interval type-2 fuzzy arc lengths A Dey, R Pradhan, A Pal, T Pal Malaysian Journal of Computer Science 31 (4), 255-270, 2018 | 49 | 2018 |

A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs A Dey, S Broumi, A Bakali, M Talea, F Smarandache Granular Computing, 1-7, 2018 | 49 | 2018 |

Modified Vogel’s approximation method for transportation problem under uncertain environment J Pratihar, R Kumar, SA Edalatpanah, A Dey Complex & intelligent systems 7 (1), 29-40, 2021 | 46 | 2021 |

Fuzzy minimum spanning tree with interval type 2 fuzzy arc length: formulation and a new genetic algorithm A Dey, LH Son, A Pal, HV Long Soft computing 24 (6), 3963-3974, 2020 | 41 | 2020 |

Uniform Single Valued Neutrosophic Graphs S Broumi, A Dey, A Bakali, M Talea, F Smarandache, LH Son, D Koley Infinite Study, 2017 | 39 | 2017 |

Transportation problem in neutrosophic environment J Pratihar, R Kumar, A Dey, S Broumi Neutrosophic graph theory and algorithms, 180-212, 2020 | 36 | 2020 |

Fuzzy graph coloring technique to classify the accidental zone of a traffic control A Dey, A Pal Annals of Pure and Applied Mathematics 3 (2), 169-178, 2013 | 36 | 2013 |

Neutrosophic sets: An overview S Broumi, A Bakali, A Bahnasse Infinite Study, 2018 | 35 | 2018 |

A study of neutrosophic shortest path problem R Kumar, A Dey, S Broumi, F Smarandache Neutrosophic graph theory and algorithms, 148-179, 2020 | 34 | 2020 |

The fuzzy robust graph coloring problem A Dey, R Pradhan, A Pal, T Pal Proceedings of the 3rd International Conference on Frontiers of Intelligent …, 2015 | 33 | 2015 |

Spanning Tree Problem with Neutrosophic Edge Weights S Broumi, A Bakali, M Talea, F Smarandache, A Dey Procedia Computer Science (Elsevier) 127, 190--199, 2018 | 31 | 2018 |

Classification of trapezoidal bipolar neutrosophic number, de-bipolarization technique and its execution in cloud service-based MCGDM problem A Chakraborty, SP Mondal, S Alam, A Dey Complex & Intelligent Systems 7 (1), 145-162, 2021 | 27 | 2021 |

New concepts on vertex and edge coloring of simple vague graphs A Dey, LH Son, PKK Kumar, G Selvachandran, SG Quek Symmetry 10 (9), 373, 2018 | 26 | 2018 |

Prim's algorithm for solving minimum spanning tree problem in fuzzy environment A Dey, A Pal Annals of Fuzzy Mathematics and Informatics 12 (3), 419-430, 2016 | 26 | 2016 |

Vertex coloring of a fuzzy graph using alpa cut A Dey, A Pal International Journal of Managment, IT and Engineering 2 (8), 340-352, 2012 | 21 | 2012 |