• Sign In
  • Help
  • My Basket0
Graph Connections: Relationships between Graph Theory and Other Areas of Mathematics - Oxford Lecture Series in Mathematics and Its Applications 5 (Hardback)
  • Graph Connections: Relationships between Graph Theory and Other Areas of Mathematics - Oxford Lecture Series in Mathematics and Its Applications 5 (Hardback)
zoom

Graph Connections: Relationships between Graph Theory and Other Areas of Mathematics - Oxford Lecture Series in Mathematics and Its Applications 5 (Hardback)

(editor), (editor)
£79.00
Hardback 304 Pages / Published: 16/01/1997
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket

Check Marketplace availability

The purpose of this book is to inform mathematicians about the applicability of graph theory to other areas of mathematics, from number theory, to linear algebra, knots, neural networks, and finance. This is achieved through a series of expository chapters, each devoted to a different field and written by an expert in that field. This book is more than a collection of essays however, in that the chapters have been carefully edited to ensure a common level of exposition, with terminology and notation standardized as far as possible. This book will be useful to professsional mathematicians and graduate students. It should also appeal to scientists working in other areas.

Publisher: Oxford University Press
ISBN: 9780198514978
Number of pages: 304
Weight: 580 g
Dimensions: 241 x 161 x 22 mm

You may also be interested in...

Combinatorics
Added to basket
£49.99
Paperback
An Introduction to Combinatorial Analysis
Added to basket
Schaum's Outline of Combinatorics
Added to basket
A First Course in Network Theory
Added to basket
A Combinatorial Introduction to Topology
Added to basket
Catalan Numbers
Added to basket
Introduction to Graph Theory
Added to basket
Discrete Mathematics
Added to basket
Proofs from THE BOOK
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.