Graphs and Networks
eBook - PDF

Graphs and Networks

  1. English
  2. PDF
  3. Available on iOS & Android
eBook - PDF

Graphs and Networks

About this book

Graphs and Networks

A unique blend of graph theory and network science for mathematicians and data science professionals alike.

Featuring 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.

The 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.

Graphs and Networks also features:

  • Applications to neuroscience, climate science, and the social and political sciences
  • A research outlook integrated directly into the narrative with ideas for students interested in pursuing research projects at all levels
  • A large selection of primary and secondary sources for further reading
  • Historical notes that hint at the passion and excitement behind the discoveries
  • Practice problems that reinforce the concepts and encourage further investigation and independent work

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Graphs and Networks by S. R. Kingan in PDF and/or ePUB format, as well as other popular books in Mathematics & Number Theory. We have over one million books available in our catalogue for you to explore.

Information

Publisher
Wiley
Year
2022
Print ISBN
9781118937181
eBook ISBN
9781118937204
Edition
1

Table of contents

  1. Cover
  2. Title Page
  3. Copyright
  4. Contents
  5. List of Figures
  6. Preface
  7. Chapter 1 From Königsberg to Connectomes
  8. Chapter 2 Fundamental Topics
  9. Chapter 3 Similarity and Centrality
  10. Chapter 4 Types of Networks
  11. Chapter 5 Graph Algorithms
  12. Chapter 6 Structure, Coloring, Higher Connectivity
  13. Chapter 7 Planar Graphs
  14. Chapter 8 Flows and Matchings
  15. Appendix A Linear Algebra
  16. Appendix B Probability and Statistics
  17. Appendix C Complexity of Algorithms
  18. Appendix D Stacks and Queues
  19. Bibliography
  20. Index
  21. EULA