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, Pennsylvania (701 E. Chocolate Avenue, Hershey, Pennsylvania, 17033, USA) :
IGI Global,
[2020]
|
Schlagworte: | |
Online-Zugang: | Volltext |
Zusammenfassung: | "This book examines neutrosophic logic and graphs theory in real-life applications"-- |
Beschreibung: | 20 PDFs (405 pages) Also available in print. |
Format: | Mode of access: World Wide Web. |
Bibliographie: | Includes bibliographical references and index. |
ISBN: | 9781799813156 |
Zugangseinschränkungen: | Restricted to subscribers or individual electronic text purchasers. |
Internformat
MARC
LEADER | 00000nam a2200000 i 4500 | ||
---|---|---|---|
001 | ZDB-98-IGB-00232296 | ||
003 | IGIG | ||
005 | 20191127152855.0 | ||
006 | m eo d | ||
007 | cr bn |||m|||a | ||
008 | 191128s2020 pau fob 001 0 eng d | ||
010 | |z 2019027734 | ||
020 | |a 9781799813156 |q ebook | ||
020 | |z 1799813134 | ||
020 | |z 1799813142 | ||
020 | |z 9781799813132 |q hardcover | ||
020 | |z 9781799813149 |q paperback | ||
024 | 7 | |a 10.4018/978-1-7998-1313-2 |2 doi | |
035 | |a (CaBNVSL)slc00000137 | ||
035 | |a (OCoLC)1129580201 | ||
040 | |a CaBNVSL |b eng |e rda |c CaBNVSL |d CaBNVSL | ||
050 | 4 | |a QA9.64 |b .N48 2020e | |
082 | 7 | |a 511/.5 |2 23 | |
245 | 0 | 0 | |a Neutrosophic graph theory and algorithms |c Florentin Smarandache and Said Broumi, editors. |
264 | 1 | |a Hershey, Pennsylvania (701 E. Chocolate Avenue, Hershey, Pennsylvania, 17033, USA) : |b IGI Global, |c [2020] | |
300 | |a 20 PDFs (405 pages) | ||
336 | |a text |2 rdacontent | ||
337 | |a electronic |2 isbdmedia | ||
338 | |a online resource |2 rdacarrier | ||
504 | |a Includes bibliographical references and index. | ||
505 | 0 | |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́€èOs 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. | |
506 | |a Restricted to subscribers or individual electronic text purchasers. | ||
520 | 3 | |a "This book examines neutrosophic logic and graphs theory in real-life applications"-- |c Provided by publisher. | |
530 | |a Also available in print. | ||
538 | |a Mode of access: World Wide Web. | ||
588 | |a Description based on title screen (IGI Global, viewed 11/28/2019). | ||
650 | 0 | |a Group theory. | |
650 | 0 | |a Neutrosophic logic. | |
700 | 1 | |a Broumi, Said, |e editor. | |
700 | 1 | |a Smarandache, Florentin, |e editor. | |
710 | 2 | |a IGI Global, |e publisher. | |
776 | 0 | |c (Original) |w (DLC)2019027734 | |
776 | 0 | 8 | |i Print version: |z 1799813134 |z 9781799813132 |w (DLC) 2019027734 |
856 | 4 | 0 | |l FWS01 |p ZDB-98-IGB |q FWS_PDA_IGB |u http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-7998-1313-2 |3 Volltext |
912 | |a ZDB-98-IGB | ||
049 | |a DE-863 |
Datensatz im Suchindex
DE-BY-FWS_katkey | ZDB-98-IGB-00232296 |
---|---|
_version_ | 1804751459797958656 |
adam_text | |
any_adam_object | |
author2 | Broumi, Said Smarandache, Florentin |
author2_role | edt edt |
author2_variant | s b sb f s fs |
author_facet | Broumi, Said Smarandache, Florentin |
building | Verbundindex |
bvnumber | localFWS |
callnumber-first | Q - Science |
callnumber-label | QA9 |
callnumber-raw | QA9.64 .N48 2020e |
callnumber-search | QA9.64 .N48 2020e |
callnumber-sort | QA 19.64 N48 42020E |
callnumber-subject | QA - Mathematics |
collection | ZDB-98-IGB |
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́€èOs 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 | (CaBNVSL)slc00000137 (OCoLC)1129580201 |
dewey-full | 511/.5 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511/.5 |
dewey-search | 511/.5 |
dewey-sort | 3511 15 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02767nam a2200493 i 4500</leader><controlfield tag="001">ZDB-98-IGB-00232296</controlfield><controlfield tag="003">IGIG</controlfield><controlfield tag="005">20191127152855.0</controlfield><controlfield tag="006">m eo d </controlfield><controlfield tag="007">cr bn |||m|||a</controlfield><controlfield tag="008">191128s2020 pau fob 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="z"> 2019027734</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781799813156</subfield><subfield code="q">ebook</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1799813134</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1799813142</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781799813132</subfield><subfield code="q">hardcover</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781799813149</subfield><subfield code="q">paperback</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.4018/978-1-7998-1313-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaBNVSL)slc00000137</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1129580201</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">CaBNVSL</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="c">CaBNVSL</subfield><subfield code="d">CaBNVSL</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA9.64</subfield><subfield code="b">.N48 2020e</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">23</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Neutrosophic graph theory and algorithms </subfield><subfield code="c">Florentin Smarandache and Said Broumi, editors.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hershey, Pennsylvania (701 E. Chocolate Avenue, Hershey, Pennsylvania, 17033, USA) :</subfield><subfield code="b">IGI Global,</subfield><subfield code="c">[2020]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 PDFs (405 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">electronic</subfield><subfield code="2">isbdmedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="505" ind1="0" 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́€èOs 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="506" ind1=" " ind2=" "><subfield code="a">Restricted to subscribers or individual electronic text purchasers.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">"This book examines neutrosophic logic and graphs theory in real-life applications"--</subfield><subfield code="c">Provided by publisher.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Also available in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: World Wide Web.</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on title screen (IGI Global, viewed 11/28/2019).</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Group theory.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Neutrosophic logic.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Broumi, Said,</subfield><subfield code="e">editor.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Smarandache, Florentin,</subfield><subfield code="e">editor.</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">IGI Global,</subfield><subfield code="e">publisher.</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">(Original)</subfield><subfield code="w">(DLC)2019027734</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="z">1799813134</subfield><subfield code="z">9781799813132</subfield><subfield code="w">(DLC) 2019027734</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-98-IGB</subfield><subfield code="q">FWS_PDA_IGB</subfield><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-7998-1313-2</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-98-IGB</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
id | ZDB-98-IGB-00232296 |
illustrated | Not Illustrated |
indexdate | 2024-07-16T15:51:54Z |
institution | BVB |
isbn | 9781799813156 |
language | English |
oclc_num | 1129580201 |
open_access_boolean | |
owner | DE-863 DE-BY-FWS |
owner_facet | DE-863 DE-BY-FWS |
physical | 20 PDFs (405 pages) Also available in print. |
psigel | ZDB-98-IGB |
publishDate | 2020 |
publishDateSearch | 2020 |
publishDateSort | 2020 |
publisher | IGI Global, |
record_format | marc |
spelling | Neutrosophic graph theory and algorithms Florentin Smarandache and Said Broumi, editors. Hershey, Pennsylvania (701 E. Chocolate Avenue, Hershey, Pennsylvania, 17033, USA) : IGI Global, [2020] 20 PDFs (405 pages) text rdacontent electronic isbdmedia online resource rdacarrier Includes bibliographical references and index. 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́€èOs 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. Restricted to subscribers or individual electronic text purchasers. "This book examines neutrosophic logic and graphs theory in real-life applications"-- Provided by publisher. Also available in print. Mode of access: World Wide Web. Description based on title screen (IGI Global, viewed 11/28/2019). Group theory. Neutrosophic logic. Broumi, Said, editor. Smarandache, Florentin, editor. IGI Global, publisher. (Original) (DLC)2019027734 Print version: 1799813134 9781799813132 (DLC) 2019027734 FWS01 ZDB-98-IGB FWS_PDA_IGB http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-7998-1313-2 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́€èOs 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. Group theory. Neutrosophic logic. |
title | Neutrosophic graph theory and algorithms |
title_auth | Neutrosophic graph theory and algorithms |
title_exact_search | Neutrosophic graph theory and algorithms |
title_full | Neutrosophic graph theory and algorithms Florentin Smarandache and Said Broumi, editors. |
title_fullStr | Neutrosophic graph theory and algorithms Florentin Smarandache and Said Broumi, editors. |
title_full_unstemmed | Neutrosophic graph theory and algorithms Florentin Smarandache and Said Broumi, editors. |
title_short | Neutrosophic graph theory and algorithms |
title_sort | neutrosophic graph theory and algorithms |
topic | Group theory. Neutrosophic logic. |
topic_facet | Group theory. Neutrosophic logic. |
url | http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-7998-1313-2 |
work_keys_str_mv | AT broumisaid neutrosophicgraphtheoryandalgorithms AT smarandacheflorentin neutrosophicgraphtheoryandalgorithms AT igiglobal neutrosophicgraphtheoryandalgorithms |