Graphical Enumeration:
Graphical Enumeration deals with the enumeration of various kinds of graphs. Topics covered range from labeled enumeration and George Pólya's theorem to rooted and unrooted trees, graphs and digraphs, and power group enumeration. Superposition, blocks, and asymptotics are also discussed. A numb...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Saint Louis
Elsevier Science
2014
|
| Schlagworte: | |
| Online-Zugang: | FAW01 |
| Zusammenfassung: | Graphical Enumeration deals with the enumeration of various kinds of graphs. Topics covered range from labeled enumeration and George Pólya's theorem to rooted and unrooted trees, graphs and digraphs, and power group enumeration. Superposition, blocks, and asymptotics are also discussed. A number of unsolved enumeration problems are presented.Comprised of 10 chapters, this book begins with an overview of labeled graphs, followed by a description of the basic enumeration theorem of Pólya. The next three chapters count an enormous variety of trees, graphs, and digraphs. The Power Group Enumeration Theorem is then described together with some of its applications, including the enumeration of self-complementary graphs and digraphs and finite automata. Two other chapters focus on the counting of superposition and blocks, while another chapter is devoted to asymptotic numbers that are developed for several different graphical structures. The book concludes with a comprehensive definitive list of unsolved graphical enumeration problems.This monograph will be of interest to both students and practitioners of mathematics |
| Beschreibung: | Description based on publisher supplied metadata and other sources |
| Beschreibung: | 1 online resource (286 pages) |
| ISBN: | 9781483273785 9780123242457 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043615459 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 160616s2014 |||| o||u| ||||||eng d | ||
| 020 | |a 9781483273785 |9 978-1-4832-7378-5 | ||
| 020 | |a 9780123242457 |c Print |9 978-0-12-324245-7 | ||
| 035 | |a (ZDB-30-PQE)EBC1888445 | ||
| 035 | |a (ZDB-89-EBL)EBL1888445 | ||
| 035 | |a (ZDB-38-EBR)ebr10999560 | ||
| 035 | |a (OCoLC)892066932 | ||
| 035 | |a (DE-599)BVBBV043615459 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 | ||
| 082 | 0 | |a 511.5 | |
| 100 | 1 | |a Harary, Frank |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Graphical Enumeration |
| 264 | 1 | |a Saint Louis |b Elsevier Science |c 2014 | |
| 264 | 4 | |c © 1973 | |
| 300 | |a 1 online resource (286 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Description based on publisher supplied metadata and other sources | ||
| 520 | |a Graphical Enumeration deals with the enumeration of various kinds of graphs. Topics covered range from labeled enumeration and George Pólya's theorem to rooted and unrooted trees, graphs and digraphs, and power group enumeration. Superposition, blocks, and asymptotics are also discussed. A number of unsolved enumeration problems are presented.Comprised of 10 chapters, this book begins with an overview of labeled graphs, followed by a description of the basic enumeration theorem of Pólya. The next three chapters count an enormous variety of trees, graphs, and digraphs. The Power Group Enumeration Theorem is then described together with some of its applications, including the enumeration of self-complementary graphs and digraphs and finite automata. Two other chapters focus on the counting of superposition and blocks, while another chapter is devoted to asymptotic numbers that are developed for several different graphical structures. The book concludes with a comprehensive definitive list of unsolved graphical enumeration problems.This monograph will be of interest to both students and practitioners of mathematics | ||
| 650 | 4 | |a Combinatorial enumeration problems | |
| 650 | 4 | |a Graph theory | |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Palmer, Edgar M. |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Harary, Frank |t Graphical Enumeration |
| 912 | |a ZDB-30-PQE |a ZDB-33-ESD |a ZDB-33-EBS | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029029518 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://www.sciencedirect.com/science/book/9780123242457 |l FAW01 |p ZDB-33-ESD |q FAW_PDA_ESD |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176358054559744 |
|---|---|
| any_adam_object | |
| author | Harary, Frank |
| author_facet | Harary, Frank |
| author_role | aut |
| author_sort | Harary, Frank |
| author_variant | f h fh |
| building | Verbundindex |
| bvnumber | BV043615459 |
| collection | ZDB-30-PQE ZDB-33-ESD ZDB-33-EBS |
| ctrlnum | (ZDB-30-PQE)EBC1888445 (ZDB-89-EBL)EBL1888445 (ZDB-38-EBR)ebr10999560 (OCoLC)892066932 (DE-599)BVBBV043615459 |
| 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.5 |
| 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>02988nmm a2200517zc 4500</leader><controlfield tag="001">BV043615459</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">160616s2014 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781483273785</subfield><subfield code="9">978-1-4832-7378-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780123242457</subfield><subfield code="c">Print</subfield><subfield code="9">978-0-12-324245-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PQE)EBC1888445</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-89-EBL)EBL1888445</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-38-EBR)ebr10999560</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)892066932</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043615459</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-1046</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Harary, Frank</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graphical Enumeration</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Saint Louis</subfield><subfield code="b">Elsevier Science</subfield><subfield code="c">2014</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 1973</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (286 pages)</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="500" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Graphical Enumeration deals with the enumeration of various kinds of graphs. Topics covered range from labeled enumeration and George Pólya's theorem to rooted and unrooted trees, graphs and digraphs, and power group enumeration. Superposition, blocks, and asymptotics are also discussed. A number of unsolved enumeration problems are presented.Comprised of 10 chapters, this book begins with an overview of labeled graphs, followed by a description of the basic enumeration theorem of Pólya. The next three chapters count an enormous variety of trees, graphs, and digraphs. The Power Group Enumeration Theorem is then described together with some of its applications, including the enumeration of self-complementary graphs and digraphs and finite automata. Two other chapters focus on the counting of superposition and blocks, while another chapter is devoted to asymptotic numbers that are developed for several different graphical structures. The book concludes with a comprehensive definitive list of unsolved graphical enumeration problems.This monograph will be of interest to both students and practitioners of mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial enumeration problems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Palmer, Edgar M.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Harary, Frank</subfield><subfield code="t">Graphical Enumeration</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PQE</subfield><subfield code="a">ZDB-33-ESD</subfield><subfield code="a">ZDB-33-EBS</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029029518</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://www.sciencedirect.com/science/book/9780123242457</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-33-ESD</subfield><subfield code="q">FAW_PDA_ESD</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043615459 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:30:54Z |
| institution | BVB |
| isbn | 9781483273785 9780123242457 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029029518 |
| oclc_num | 892066932 |
| open_access_boolean | |
| owner | DE-1046 |
| owner_facet | DE-1046 |
| physical | 1 online resource (286 pages) |
| psigel | ZDB-30-PQE ZDB-33-ESD ZDB-33-EBS ZDB-33-ESD FAW_PDA_ESD |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | Elsevier Science |
| record_format | marc |
| spelling | Harary, Frank Verfasser aut Graphical Enumeration Saint Louis Elsevier Science 2014 © 1973 1 online resource (286 pages) txt rdacontent c rdamedia cr rdacarrier Description based on publisher supplied metadata and other sources Graphical Enumeration deals with the enumeration of various kinds of graphs. Topics covered range from labeled enumeration and George Pólya's theorem to rooted and unrooted trees, graphs and digraphs, and power group enumeration. Superposition, blocks, and asymptotics are also discussed. A number of unsolved enumeration problems are presented.Comprised of 10 chapters, this book begins with an overview of labeled graphs, followed by a description of the basic enumeration theorem of Pólya. The next three chapters count an enormous variety of trees, graphs, and digraphs. The Power Group Enumeration Theorem is then described together with some of its applications, including the enumeration of self-complementary graphs and digraphs and finite automata. Two other chapters focus on the counting of superposition and blocks, while another chapter is devoted to asymptotic numbers that are developed for several different graphical structures. The book concludes with a comprehensive definitive list of unsolved graphical enumeration problems.This monograph will be of interest to both students and practitioners of mathematics Combinatorial enumeration problems Graph theory Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s 1\p DE-604 Graph (DE-588)4021842-9 s 2\p DE-604 Palmer, Edgar M. Sonstige oth Erscheint auch als Druck-Ausgabe Harary, Frank Graphical Enumeration 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Harary, Frank Graphical Enumeration Combinatorial enumeration problems Graph theory Graphentheorie (DE-588)4113782-6 gnd Graph (DE-588)4021842-9 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4021842-9 |
| title | Graphical Enumeration |
| title_auth | Graphical Enumeration |
| title_exact_search | Graphical Enumeration |
| title_full | Graphical Enumeration |
| title_fullStr | Graphical Enumeration |
| title_full_unstemmed | Graphical Enumeration |
| title_short | Graphical Enumeration |
| title_sort | graphical enumeration |
| topic | Combinatorial enumeration problems Graph theory Graphentheorie (DE-588)4113782-6 gnd Graph (DE-588)4021842-9 gnd |
| topic_facet | Combinatorial enumeration problems Graph theory Graphentheorie Graph |
| work_keys_str_mv | AT hararyfrank graphicalenumeration AT palmeredgarm graphicalenumeration |