External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Said Broumi

This author has not been identified. Look up 'Said Broumi' in Google

Mohamed Talea

This author has not been identified. Look up 'Mohamed Talea' in Google

Assia Bakali

This author has not been identified. Look up 'Assia Bakali' in Google

Florentin Smarandache

This author has not been identified. Look up 'Florentin Smarandache' in Google

P. K. Kishore Kumar

This author has not been identified. Look up 'P. K. Kishore Kumar' in Google
runs on