Graphs and Networks

Regular price €98.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=S. R. Kingan
Age Group_Uncategorized
Age Group_Uncategorized
Author_S. R. Kingan
automatic-update
Category1=Non-Fiction
Category=PB
Category=PBV
Category=TJ
colorings
COP=United States
degree sequences
Delivery_Delivery within 10-20 working days
eq_bestseller
eq_isMigrated=2
eq_nobargain
eq_non-fiction
eq_tech-engineering
Eulerian circuits
graph algorithms
graph operations
graph statistics
graph substructures
Hamiltonian cycles
isomorphism
Language_English
matchings and coverings
network algorithms
PA=Available
planar graphs
Price_€50 to €100
PS=Active
random graphs
softlaunch
tress

Product details

  • ISBN 9781118937181
  • Weight: 567g
  • Dimensions: 155 x 231mm
  • Publication Date: 29 Apr 2022
  • Publisher: John Wiley & Sons Inc
  • Publication City/Country: US
  • Product Form: Hardback
  • Language: English
Secure checkout Fast Shipping Easy returns
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

S. R. Kingan is an Associate Professor of Mathematics at Brooklyn College and the Graduate Center of The City University of New York. Dr. Kingan’s research interests include graph theory, matroid theory, combinatorial algorithms, and their applications.

More from this author