Skip to main content
SpringerLink
Log in

Strong Degrees in Single Valued Neutrosophic Graphs

  • Conference paper
  • First Online:
Advances in Information and Communication Networks (FICC 2018)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 886))

Included in the following conference series:

Abstract

The concept of Single Valued Neutrosophic Graphs (SVNGs) generalizes fuzzy graphs and intuitionistic fuzzy graphs. The purpose of this research paper is to define different types of strong degrees in SVNGs and introduce novel concepts, such as the vertex membership of truth-values, vertex membership of indeterminate-values and vertex membership of false-values, which are sequence of SVNG with proof and numerical illustrations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Smarandache, F.: Neutrosophy. Neutrosophic Probability, Set, and Logic, ProQuest Information & Learning, Ann Arbor, 105 p. (1998)

    Google Scholar 

  2. Atanassov, K.: Intuitionistic fuzzy sets: theory and applications, Physica, New York (1999)

    Chapter  Google Scholar 

  3. Smarandache, F.: A Unifying Field in Logic. Neutrosophy: Neutrosophic Probability, Set, Logic, 4th edn. American Research Press, Rehoboth (2005)

    MATH  Google Scholar 

  4. Zadeh, L.: Fuzzy logic and approximate reasoning. Synthese 30(3–4), 407–428 (1975)

    Article  Google Scholar 

  5. Zadeh, L.: Fuzzy sets. Inf. Control 8, 338–353 (1965)

    Article  Google Scholar 

  6. Atanassov, K.: Intuitionistic fuzzy sets. Fuzzy Sets Syst. 20, 87–96 (1986)

    Article  Google Scholar 

  7. Wang, H., Smarandache, F., Zhang, Y., Sunderraman, R.: Single valued neutrosophic sets. Multispace Multisrtuct. 4, 410–413 (2010)

    MATH  Google Scholar 

  8. http://fs.gallup.unm.edu/NSS

  9. Broumi, S., Talea, M., Bakali, A., Smarandache, F.: Single valued neutrosophic graphs. J. New Theor. 10, 86–101 (2016)

    Google Scholar 

  10. Broumi, S., Talea, M., Bakali, A., Smarandache, F.: On bipolar single valued neutrosophic graphs. J. New Theor. 11, 84–102 (2016)

    Google Scholar 

  11. Broumi, S., Bakali, A., Talea, M., Smarandache, F.: Isolated single valued neutrosophic graphs. Neutrosophic Sets Syst. 11, 74–78 (2016)

    Google Scholar 

  12. Broumi, S., Smarandache, F., Talea, M., Bakali, A.: An introduction to bipolar single valued neutrosophic graph theory. Appl. Mech. Mater. 841, 184–191 (2016)

    Article  Google Scholar 

  13. Broumi, S., Smarandache, F., Talea, M., Bakali, A.: Decision-making method based on the interval valued neutrosophic graph. In: Future Technologie, pp. 44–50. IEEE (2016)

    Google Scholar 

  14. Broumi, S., Talea, M., Smarandache, F., Bakali, A.: Single valued neutrosophic graphs: degree, order and size. In: IEEE World Congress on Computational Intelligence, pp. 2444–2451 (2016)

    Google Scholar 

  15. Broumi, S., Bakali, A., Talea, M., Smarandache, F.: Shortest path problem under trapezoidal neutrosophic information. In: Computing Conference 2017, 18–20 July 2017, pp. 142–148 (2017)

    Google Scholar 

  16. Broumi, S., Bakali, A., Talea, M., Smarandache, F., Vladareanu, L.: Computation of shortest path problem in a network with SV-trapezoidal neutrosophic numbers. In: Proceedings of the 2016 International Conference on Advanced Mechatronic Systems, Melbourne, pp. 417–422 (2016)

    Google Scholar 

  17. Broumi, S., Bakali, A., Talea, M., Smarandache, F., Vladareanu, L.: Applying Dijkstra algorithm for solving neutrosophic shortest path problem. In: Proceedings of the 2016 International Conference on Advanced Mechatronic Systems, Melbourne, pp. 412–416 (2016)

    Google Scholar 

  18. Broumi, S., Talea, M., Bakali, A., Smarandache, F.: Interval valued interval valued neutrosophic graphs. In: Critical Review, XII, pp. 5–33 (2016)

    Google Scholar 

  19. Broumi, S., Bakali, A., Mohamed, T., Smarandache, F., Vladareanu, L.: Shortest path problem under triangular fuzzy neutrosophic information. In: 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA), pp. 169–174 (2016)

    Google Scholar 

  20. Broumi, S., Smarandache, F., Talea, M., Bakali, A.: Operations on interval valued neutrosophic graphs. In: Smarandache, F., SurpatiPramanik (eds.) New Trends in Neutrosophic Theory and Applications, pp. 231–254 (2016). ISBN 978-1-59973-498-9

    Google Scholar 

  21. Broumi, S., Bakali, A., Talea, M., Smarandache, F., Ali, M.: Shortest path problem under bipolar neutrosphic setting. Appl. Mech. Mater. 859, 59–66 (2016)

    Article  Google Scholar 

  22. Ashraf, S., Naz, S., Rashmanlou, H., Malik, M.A.: Regularity of graphs in single valued neutrosophic environment. J. Intell. Fuzzy Syst. 33(1), 529–542 (2017)

    Article  Google Scholar 

  23. Naz, S., Rashmanlou, H., Malik, M.A.: Operations on single valued neutrosophic graphs with application. J. Intell. & Fuzzy Syst. 32(3), 2137–2151 (2017)

    Article  Google Scholar 

  24. Mehra, S., Singh, M.: Single valued neutrosophic signed graphs. Int. J. Comput. Appl. 157(9), 32–34 (2017)

    Article  Google Scholar 

  25. Hamidi, M., Bourumand Saeid, A.: Accessible single valued neutrosophic graphs. J. Appl. Math. Comput. 21 (2017)

    Google Scholar 

  26. Akram, M., Shahzadi, G.: Operations on single-valued neutrosophic graphs. J. Uncertain Syst. 11, 1–26 (2017)

    MATH  Google Scholar 

  27. Akram, M.: Single-valued neutrosophic planar graphs. Int. J. Algebra Stat. 5(2), 157–167 (2016)

    Article  Google Scholar 

  28. Akram, M., Shahzadi, S.: Neutrosophic soft graphs with application. J. Intell. Fuzzy Syst. 1–18 (2016). https://doi.org/10.3233/jifs-16090

    Article  Google Scholar 

  29. Karunambigai, M.G., Buvaneswari, R.: Degrees in intuitionistic fuzzy graphs. Ann. Fuzzy Math. Inform. (2016)

    Google Scholar 

  30. Hassan, A., Malik, M.A., Broumi, S., Bakali, A., Talea, M., Smarandache, F.: Special types of bipolar single valued neutrosophic graphs. Ann. Fuzzy Math. Inform. 14(1), 55–73 (2017)

    Google Scholar 

  31. Mullai, M., Broumi, S., Stephen, A.: Shortest path problem by minimal spanning tree algorithm using bipolar neutrosophic numbers. Int. J. Math. Trends Technol. 46(2), 80–87 (2017)

    Article  Google Scholar 

  32. Broumi, S., Bakali, A., Talea, M., Smarandache, F., Kishore Kumar, P.K.: Shortest path problem on single valued neutrosophic graphs. In: International Symposium on Networks, Computers and Communications (ISNCC) (2017)

    Google Scholar 

Download references

Acknowledgment

The authors would like to thank anonymous reviewers for the constructive suggestions that improved the quality of the paper.

Author information

Authors and Affiliations

  1. Laboratory of Information Processing, Faculty of Science Ben M’Sik, University Hassan II, 7955, Sidi Othman, Casablanca, Morocco

    Said Broumi & Mohamed Talea

  2. Department of Mathematics, University of New Mexico, 705 Gurley Avenue, Gallup, NM, 87301, USA

    Florentin Smarandache

  3. Ecole Royale Navale, Boulevard Sour Jdid, 16303, Casablanca, Morocco

    Assia Bakali

  4. Department of Mathematics, Maharshi Dayanand University, Rohtak, India

    Seema Mehra

  5. Department of Mathematics, K.L.P. College, Rewari, Rohtak, India

    Manjeet Singh

Authors
  1. Said Broumi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Florentin Smarandache
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Assia Bakali
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Seema Mehra
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Mohamed Talea
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Manjeet Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Said Broumi .

Editor information

Editors and Affiliations

  1. Faculty of Science and Engineering, Saga University, Saga, Japan

    Kohei Arai

  2. The Science and Information (SAI) Organization, London, UK

    Supriya Kapoor

  3. The Science and Information (SAI) Organization, Bradford, UK

    Rahul Bhatia

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Broumi, S., Smarandache, F., Bakali, A., Mehra, S., Talea, M., Singh, M. (2019). Strong Degrees in Single Valued Neutrosophic Graphs. In: Arai, K., Kapoor, S., Bhatia, R. (eds) Advances in Information and Communication Networks. FICC 2018. Advances in Intelligent Systems and Computing, vol 886. Springer, Cham. https://doi.org/10.1007/978-3-030-03402-3_16

Download citation

Publish with us

Policies and ethics

Search

Navigation