Neutrosophic graph theory and algorithms:
"This book examines neutrosophic logic and graphs theory in real-life applications"--
Gespeichert in:
| Weitere Verfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Hershey, PA
IGI Global
[2020]
|
| Schlagworte: | |
| Online-Zugang: | DE-1050 DE-573 DE-898 DE-1049 DE-706 DE-83 Volltext |
| Zusammenfassung: | "This book examines neutrosophic logic and graphs theory in real-life applications"-- |
| Beschreibung: | 1 Online-Ressource |
| ISBN: | 9781799813156 |
| DOI: | 10.4018/978-1-7998-1313-2 |
Internformat
MARC
| LEADER | 00000nmm a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV046733371 | ||
| 003 | DE-604 | ||
| 005 | 20211110 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200524s2020 |||| o||u| ||||||eng d | ||
| 020 | |a 9781799813156 |9 978-1-7998-1315-6 | ||
| 035 | |a (OCoLC)1224486915 | ||
| 035 | |a (DE-599)BVBBV046733371 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1050 |a DE-1049 |a DE-91 |a DE-573 |a DE-898 |a DE-706 |a DE-83 | ||
| 245 | 1 | 0 | |a Neutrosophic graph theory and algorithms |c Florentin Smarandache, Said Broumi |
| 264 | 1 | |a Hershey, PA |b IGI Global |c [2020] | |
| 300 | |a 1 Online-Ressource | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 505 | 8 | |a Chapter 1. Finding the shortest path with neutrosophic theory: a tool for network optimization -- Chapter 2. Decision-making method based on neutrosophic soft expert graphs -- Chapter 3. Application of Floyd's algorithm in interval valued neutrosophic setting -- Chapter 4. New algorithms for Hamiltonian Cycle Under Interval Neutrosophic Environment -- Chapter 5. Dominations in neutrosophic graphs -- Chapter 6. A study of neutrosophic shortest path problem -- Chapter 7. Transportation problem in neutrosophic environment -- Chapter 8. Introduction to Plithogenic subgroup -- Chapter 9. Minimal spanning tree in cylindrical single-valued neutrosophic arena -- Chapter 10. Two centroid point for SVTN-numbers and SVTrN-numbers: SVN-MADM method -- Chapter 11. Distinguishable and inverses of neutrosophic finite automata -- Chapter 12. Neutrosophic soft digraph | |
| 520 | |a "This book examines neutrosophic logic and graphs theory in real-life applications"-- | ||
| 650 | 4 | |a Neutrosophic logic | |
| 650 | 4 | |a Group theory | |
| 650 | 7 | |a Group theory |2 fast | |
| 650 | 7 | |a Neutrosophic logic |2 fast | |
| 700 | 1 | |a Smarandache, Florentin |d 1954- |0 (DE-588)11933531X |4 edt | |
| 700 | 1 | |a Broumi, Said |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, hardcover |z 978-1-7998-1313-2 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, softcover |z 978-1-7998-1314-9 |
| 856 | 4 | 0 | |u https://doi.org/10.4018/978-1-7998-1313-2 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-98-IGB |a ZDB-1-IGE | ||
| 966 | e | |u https://doi.org/10.4018/978-1-7998-1313-2 |l DE-1050 |p ZDB-98-IGB |q FHD01_IGB_Kauf |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.4018/978-1-7998-1313-2 |l DE-573 |p ZDB-1-IGE |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.4018/978-1-7998-1313-2 |l DE-898 |p ZDB-1-IGE |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.4018/978-1-7998-1313-2 |l DE-1049 |p ZDB-1-IGE |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.4018/978-1-7998-1313-2 |l DE-706 |p ZDB-98-IGB |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.4018/978-1-7998-1313-2 |l DE-83 |p ZDB-98-IGB |q TUB_EBS_IGB |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1805083767518265344 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author2 | Smarandache, Florentin 1954- Broumi, Said |
| author2_role | edt edt |
| author2_variant | f s fs s b sb |
| author_GND | (DE-588)11933531X |
| author_facet | Smarandache, Florentin 1954- Broumi, Said |
| building | Verbundindex |
| bvnumber | BV046733371 |
| collection | ZDB-98-IGB ZDB-1-IGE |
| contents | Chapter 1. Finding the shortest path with neutrosophic theory: a tool for network optimization -- Chapter 2. Decision-making method based on neutrosophic soft expert graphs -- Chapter 3. Application of Floyd's algorithm in interval valued neutrosophic setting -- Chapter 4. New algorithms for Hamiltonian Cycle Under Interval Neutrosophic Environment -- Chapter 5. Dominations in neutrosophic graphs -- Chapter 6. A study of neutrosophic shortest path problem -- Chapter 7. Transportation problem in neutrosophic environment -- Chapter 8. Introduction to Plithogenic subgroup -- Chapter 9. Minimal spanning tree in cylindrical single-valued neutrosophic arena -- Chapter 10. Two centroid point for SVTN-numbers and SVTrN-numbers: SVN-MADM method -- Chapter 11. Distinguishable and inverses of neutrosophic finite automata -- Chapter 12. Neutrosophic soft digraph |
| ctrlnum | (OCoLC)1224486915 (DE-599)BVBBV046733371 |
| doi_str_mv | 10.4018/978-1-7998-1313-2 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nmm a2200000 c 4500</leader><controlfield tag="001">BV046733371</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20211110</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200524s2020 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781799813156</subfield><subfield code="9">978-1-7998-1315-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1224486915</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046733371</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1050</subfield><subfield code="a">DE-1049</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Neutrosophic graph theory and algorithms</subfield><subfield code="c">Florentin Smarandache, Said Broumi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hershey, PA</subfield><subfield code="b">IGI Global</subfield><subfield code="c">[2020]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Chapter 1. Finding the shortest path with neutrosophic theory: a tool for network optimization -- Chapter 2. Decision-making method based on neutrosophic soft expert graphs -- Chapter 3. Application of Floyd's algorithm in interval valued neutrosophic setting -- Chapter 4. New algorithms for Hamiltonian Cycle Under Interval Neutrosophic Environment -- Chapter 5. Dominations in neutrosophic graphs -- Chapter 6. A study of neutrosophic shortest path problem -- Chapter 7. Transportation problem in neutrosophic environment -- Chapter 8. Introduction to Plithogenic subgroup -- Chapter 9. Minimal spanning tree in cylindrical single-valued neutrosophic arena -- Chapter 10. Two centroid point for SVTN-numbers and SVTrN-numbers: SVN-MADM method -- Chapter 11. Distinguishable and inverses of neutrosophic finite automata -- Chapter 12. Neutrosophic soft digraph</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">"This book examines neutrosophic logic and graphs theory in real-life applications"--</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Neutrosophic logic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Group theory</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Group theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Neutrosophic logic</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Smarandache, Florentin</subfield><subfield code="d">1954-</subfield><subfield code="0">(DE-588)11933531X</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Broumi, Said</subfield><subfield code="4">edt</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, hardcover</subfield><subfield code="z">978-1-7998-1313-2</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, softcover</subfield><subfield code="z">978-1-7998-1314-9</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.4018/978-1-7998-1313-2</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-98-IGB</subfield><subfield code="a">ZDB-1-IGE</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.4018/978-1-7998-1313-2</subfield><subfield code="l">DE-1050</subfield><subfield code="p">ZDB-98-IGB</subfield><subfield code="q">FHD01_IGB_Kauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.4018/978-1-7998-1313-2</subfield><subfield code="l">DE-573</subfield><subfield code="p">ZDB-1-IGE</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.4018/978-1-7998-1313-2</subfield><subfield code="l">DE-898</subfield><subfield code="p">ZDB-1-IGE</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.4018/978-1-7998-1313-2</subfield><subfield code="l">DE-1049</subfield><subfield code="p">ZDB-1-IGE</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.4018/978-1-7998-1313-2</subfield><subfield code="l">DE-706</subfield><subfield code="p">ZDB-98-IGB</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.4018/978-1-7998-1313-2</subfield><subfield code="l">DE-83</subfield><subfield code="p">ZDB-98-IGB</subfield><subfield code="q">TUB_EBS_IGB</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046733371 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T14:37:04Z |
| indexdate | 2024-07-20T07:53:48Z |
| institution | BVB |
| isbn | 9781799813156 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032143413 |
| oclc_num | 1224486915 |
| open_access_boolean | |
| owner | DE-1050 DE-1049 DE-91 DE-BY-TUM DE-573 DE-898 DE-BY-UBR DE-706 DE-83 |
| owner_facet | DE-1050 DE-1049 DE-91 DE-BY-TUM DE-573 DE-898 DE-BY-UBR DE-706 DE-83 |
| physical | 1 Online-Ressource |
| psigel | ZDB-98-IGB ZDB-1-IGE ZDB-98-IGB FHD01_IGB_Kauf ZDB-98-IGB TUB_EBS_IGB |
| publishDate | 2020 |
| publishDateSearch | 2020 |
| publishDateSort | 2020 |
| publisher | IGI Global |
| record_format | marc |
| spelling | Neutrosophic graph theory and algorithms Florentin Smarandache, Said Broumi Hershey, PA IGI Global [2020] 1 Online-Ressource txt rdacontent c rdamedia cr rdacarrier Chapter 1. Finding the shortest path with neutrosophic theory: a tool for network optimization -- Chapter 2. Decision-making method based on neutrosophic soft expert graphs -- Chapter 3. Application of Floyd's algorithm in interval valued neutrosophic setting -- Chapter 4. New algorithms for Hamiltonian Cycle Under Interval Neutrosophic Environment -- Chapter 5. Dominations in neutrosophic graphs -- Chapter 6. A study of neutrosophic shortest path problem -- Chapter 7. Transportation problem in neutrosophic environment -- Chapter 8. Introduction to Plithogenic subgroup -- Chapter 9. Minimal spanning tree in cylindrical single-valued neutrosophic arena -- Chapter 10. Two centroid point for SVTN-numbers and SVTrN-numbers: SVN-MADM method -- Chapter 11. Distinguishable and inverses of neutrosophic finite automata -- Chapter 12. Neutrosophic soft digraph "This book examines neutrosophic logic and graphs theory in real-life applications"-- Neutrosophic logic Group theory Group theory fast Neutrosophic logic fast Smarandache, Florentin 1954- (DE-588)11933531X edt Broumi, Said edt Erscheint auch als Druck-Ausgabe, hardcover 978-1-7998-1313-2 Erscheint auch als Druck-Ausgabe, softcover 978-1-7998-1314-9 https://doi.org/10.4018/978-1-7998-1313-2 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Neutrosophic graph theory and algorithms Chapter 1. Finding the shortest path with neutrosophic theory: a tool for network optimization -- Chapter 2. Decision-making method based on neutrosophic soft expert graphs -- Chapter 3. Application of Floyd's algorithm in interval valued neutrosophic setting -- Chapter 4. New algorithms for Hamiltonian Cycle Under Interval Neutrosophic Environment -- Chapter 5. Dominations in neutrosophic graphs -- Chapter 6. A study of neutrosophic shortest path problem -- Chapter 7. Transportation problem in neutrosophic environment -- Chapter 8. Introduction to Plithogenic subgroup -- Chapter 9. Minimal spanning tree in cylindrical single-valued neutrosophic arena -- Chapter 10. Two centroid point for SVTN-numbers and SVTrN-numbers: SVN-MADM method -- Chapter 11. Distinguishable and inverses of neutrosophic finite automata -- Chapter 12. Neutrosophic soft digraph Neutrosophic logic Group theory Group theory fast Neutrosophic logic fast |
| title | Neutrosophic graph theory and algorithms |
| title_auth | Neutrosophic graph theory and algorithms |
| title_exact_search | Neutrosophic graph theory and algorithms |
| title_exact_search_txtP | Neutrosophic graph theory and algorithms |
| title_full | Neutrosophic graph theory and algorithms Florentin Smarandache, Said Broumi |
| title_fullStr | Neutrosophic graph theory and algorithms Florentin Smarandache, Said Broumi |
| title_full_unstemmed | Neutrosophic graph theory and algorithms Florentin Smarandache, Said Broumi |
| title_short | Neutrosophic graph theory and algorithms |
| title_sort | neutrosophic graph theory and algorithms |
| topic | Neutrosophic logic Group theory Group theory fast Neutrosophic logic fast |
| topic_facet | Neutrosophic logic Group theory |
| url | https://doi.org/10.4018/978-1-7998-1313-2 |
| work_keys_str_mv | AT smarandacheflorentin neutrosophicgraphtheoryandalgorithms AT broumisaid neutrosophicgraphtheoryandalgorithms |