{"product_id":"graphs-and-networks-hardback-9781118937181","title":"Graphs and Networks (Hardback) 9781118937181","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eGraphs and Networks\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cfont size=\"4\"\u003eS. R. Kingan (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9781118937181, Wiley\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 29 April 2022\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e288 pages\u003cbr\u003e23.1 x 15.5 x 2.3 cm, 0.567 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003e\u003cb\u003eGraphs and Networks\u003c\/b\u003e  \u003cp\u003e\u003cb\u003eA unique blend of graph theory and network science for mathematicians and data science professionals alike.\u003c\/b\u003e \u003c\/p\u003e\n\u003cp\u003eFeaturing topics such as minors, connectomes, trees, distance, spectral graph theory, similarity, centrality, small-world networks, scale-free networks, graph algorithms, Eulerian circuits, Hamiltonian cycles, coloring, higher connectivity, planar graphs, flows, matchings, and coverings, Graphs and Networks contains modern applications for graph theorists and a host of useful theorems for network scientists. \u003c\/p\u003e\n\u003cp\u003eThe book begins with applications to biology and the social and political sciences and gradually takes a more theoretical direction toward graph structure theory and combinatorial optimization. A background in linear algebra, probability, and statistics provides the proper frame of reference.  \u003c\/p\u003e\n\u003cp\u003eGraphs and Networks also features: \u003c\/p\u003e\n\u003cul\u003e\n\u003cli\u003eApplications to neuroscience, climate science, and the social and political sciences\u003c\/li\u003e \u003cli\u003eA research outlook integrated directly into the narrative with ideas for students interested in pursuing research projects at all levels\u003c\/li\u003e \u003cli\u003eA large selection of primary and secondary sources for further reading \u003c\/li\u003e\n\u003cli\u003e Historical notes that hint at the passion and excitement behind the discoveries\u003c\/li\u003e \u003cli\u003ePractice problems that reinforce the concepts and encourage further investigation and independent work\u003c\/li\u003e\n\u003c\/ul\u003e\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e\u003cp\u003eList of Figures iv\u003c\/p\u003e \u003cp\u003ePreface viii\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 1. From Königsberg to Connectomes 1\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e1.1. Introduction 1\u003c\/p\u003e \u003cp\u003e1.2. Isomorphism 18\u003c\/p\u003e \u003cp\u003e1.3. Minors and Constructions 25\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 2. Fundamental Topics 39\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e2.1. Trees 39\u003c\/p\u003e \u003cp\u003e2.2. Distance 44\u003c\/p\u003e \u003cp\u003e2.3. Degree Sequences 52\u003c\/p\u003e \u003cp\u003e2.4. Matrices 56\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 3. Similarity and Centrality 70\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e3.1. Similarity Measures 70\u003c\/p\u003e \u003cp\u003e3.2. Centrality Measures 74\u003c\/p\u003e \u003cp\u003e3.3. Eigenvector and Katz Centrality 78\u003c\/p\u003e \u003cp\u003e3.4. PageRank 84\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 4. Types of Networks 91\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e4.1. Small-World Networks 91\u003c\/p\u003e \u003cp\u003e4.2. Scale-Free Networks 95\u003c\/p\u003e \u003cp\u003e4.3. Assortative Mixing 97\u003c\/p\u003e \u003cp\u003e4.4. Covert Networks 102\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 5. Graph Algorithms 107\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e5.1. Traversal Algorithms 107\u003c\/p\u003e \u003cp\u003e5.2. Greedy Algorithms 113\u003c\/p\u003e \u003cp\u003e5.3. Shortest Path Algorithms 118\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 6. Structure, Coloring, Higher Connectivity 126\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e6.1. Eulerian Circuits 126\u003c\/p\u003e \u003cp\u003e6.2. Hamiltonian Cycles 131\u003c\/p\u003e \u003cp\u003e6.3. Coloring 136\u003c\/p\u003e \u003cp\u003e6.4. Higher Connectivity 142\u003c\/p\u003e \u003cp\u003e6.5. Menger's Theorem 148\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 7. Planar Graphs 159\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e7.1. Properties of Planar Graphs 159\u003c\/p\u003e \u003cp\u003e7.2. Euclid's Theorem on Regular Polyhedra 167\u003c\/p\u003e \u003cp\u003e7.3. The Five Color Theorem 172\u003c\/p\u003e \u003cp\u003e7.4. Invariants for Non-Planar Graphs 174\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 8. Flows and Matchings 182\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e8.1. Flows in Networks 182\u003c\/p\u003e \u003cp\u003e8.2. Stable Sets, Matchings, Coverings 188\u003c\/p\u003e \u003cp\u003e8.3. Min-Max Theorems 192\u003c\/p\u003e \u003cp\u003e8.4. Maximum Matching Algorithm 196\u003c\/p\u003e \u003cp\u003eAppendix A. Linear Algebra 211\u003c\/p\u003e \u003cp\u003eAppendix B. Probability and Statistics 215\u003c\/p\u003e \u003cp\u003eAppendix C. Complexity of Algorithms 218\u003c\/p\u003e \u003cp\u003eAppendix D. Stacks and Queues 222\u003c\/p\u003e \u003cp\u003eAppendix. Bibliography 226\u003c\/p\u003e\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematics [\u003ca title=\"See our other books on Mathematics\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematics%20%5BPB%5D%22\"\u003ePB\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Wiley","offers":[{"title":"Brand New","offer_id":52421382668568,"sku":"9781118937181","price":69.78,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/files\/9781118937181.jpg?v=1784593926","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/graphs-and-networks-hardback-9781118937181","provider":"Freshly Printed Books","version":"1.0","type":"link"}