Shortest path problem on single valued neutrosophic graphs

Said Broumi, Mohamed Talea, Assia Bakali, Florentin Smarandache, P. K. Kishore Kumar. Shortest path problem on single valued neutrosophic graphs. In 2017 International Symposium on Networks, Computers and Communications, ISNCC 2017, Marrakech, Morocco, May 16-18, 2017. pages 1-6, IEEE, 2017. [doi]

@inproceedings{BroumiTBSK17,
  title = {Shortest path problem on single valued neutrosophic graphs},
  author = {Said Broumi and Mohamed Talea and Assia Bakali and Florentin Smarandache and P. K. Kishore Kumar},
  year = {2017},
  doi = {10.1109/ISNCC.2017.8071993},
  url = {https://doi.org/10.1109/ISNCC.2017.8071993},
  researchr = {https://researchr.org/publication/BroumiTBSK17},
  cites = {0},
  citedby = {0},
  pages = {1-6},
  booktitle = {2017 International Symposium on Networks, Computers and Communications, ISNCC 2017, Marrakech, Morocco, May 16-18, 2017},
  publisher = {IEEE},
  isbn = {978-1-5090-4260-9},
}