Book

Graphs and Networks by S. R. Kingan
A unique blend of graph theory and network science for mathematicians and data science professionals alike.

Perfect for advanced undergraduates or beginning graduate students in graph theory and network science and for network scientists and data scientists seeking an insightful reference for the mathematics underlying network science.

Contains modern applications for graph theorists and a host of untapped theorems for network scientists.

Available for purchase at Amazon.

Features topics such as minors, connectomes, trees, distance, spectral graph theory, similarity, centrality, small-world networks, scale-free networks, assortative networks, covert networks, graph algorithms, Eulerian circuits, Hamiltonian cycles, coloring, higher connectivity, planar graphs, flows, matchings, and coverings.

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; and

  • Practice problems that reinforce the concepts and encourage further investigation and independent work.