Graph Theory With Applications

An introduction to graph theory. Presents the basic material, together with a wide variety of applications, both to other branches of mathematics and to real-world problems. Several good algorithms are included and their efficiencies are analysed.

**Tag(s):**
Graph Theory

**Publication date**: 31 Dec 1976

**ISBN-10**:
0333226941

**ISBN-13**:
9780333226940

**Paperback**:
270 pages

**Views**: 26,375

Graph Theory With Applications

An introduction to graph theory. Presents the basic material, together with a wide variety of applications, both to other branches of mathematics and to real-world problems. Several good algorithms are included and their efficiencies are analysed.

Terms and Conditions:

From the Preface:

This book is intended as an introduction to graph theory. Our aim has been to present what we consider to be the basic material, together with a wide variety of applications, both to other branches of mathematics and to real-world problems. Included are simple new proofs of theorems of Brooks, Chvatal, Tutte and Vizing. The applications have been carefully selected, and are treated in some depth. We have chosen to omit all so-called "applications" that employ just the language of graphs and no theory. The applications appearing at the end of each chapter actually make use of theory developed earlier in the same chapter. We have also stressed the importance of efficient methods of solving problems. Several good algorithms are included and their efficiencies are analysed. We do not, however, go into the computer implementation of these algorithms.

The exercises at the end of each section are of varying difficulty. The harder ones are starred (*) and, for these, hints are provided in appendix I. In some exercises, new definitions are introduced. The reader is recommended to acquaint himself with these definitions. Other exercises, whose numbers are indicated by bold type, are used in subsequent sections; these should all be attempted.

Appendix II consists of a table in which basic properties of four graphs are listed. When new definitions are introduced, the reader may find it helpful to check his understanding by referring to this table. Appendix III includes a selection of interesting graphs with special properties. These may prove to be useful in testing new conjectures. In appendix IV, we collect together a number of unsolved problems, some known to be very difficult, and others more hopeful. Suggestions for further reading are given in appendix V.

J. A. Bondy wrote:The text Graph Theory with Applications by U.S.R. Murty and myself has been out of print for some time. Professor Murty and I are currently preparing a new introduction to the subject, with the tentative title Graph Theory. In the meantime, we are making available pdf files of Graph Theory with Applications. They are strictly for personal use.

From the Preface:

This book is intended as an introduction to graph theory. Our aim has been to present what we consider to be the basic material, together with a wide variety of applications, both to other branches of mathematics and to real-world problems. Included are simple new proofs of theorems of Brooks, Chvatal, Tutte and Vizing. The applications have been carefully selected, and are treated in some depth. We have chosen to omit all so-called "applications" that employ just the language of graphs and no theory. The applications appearing at the end of each chapter actually make use of theory developed earlier in the same chapter. We have also stressed the importance of efficient methods of solving problems. Several good algorithms are included and their efficiencies are analysed. We do not, however, go into the computer implementation of these algorithms.

The exercises at the end of each section are of varying difficulty. The harder ones are starred (*) and, for these, hints are provided in appendix I. In some exercises, new definitions are introduced. The reader is recommended to acquaint himself with these definitions. Other exercises, whose numbers are indicated by bold type, are used in subsequent sections; these should all be attempted.

Appendix II consists of a table in which basic properties of four graphs are listed. When new definitions are introduced, the reader may find it helpful to check his understanding by referring to this table. Appendix III includes a selection of interesting graphs with special properties. These may prove to be useful in testing new conjectures. In appendix IV, we collect together a number of unsolved problems, some known to be very difficult, and others more hopeful. Suggestions for further reading are given in appendix V.

Tweet

About The Author(s)

John Adrian Bondy, (Born 1944) a dual British and Canadian citizen, was a professor of graph theory at the University of Waterloo, in Canada. He is a faculty member of Université Lyon 1, France. Bondy is known for his work on Bondy–Chvátal theorem together with Václav Chvátal. His coauthors include Paul Erdős. Bondy received his Ph.D. in graph theory from University of Oxford in 1969. Bondy has served as a managing editor and co-editor-in-chief of the Journal of Combinatorial Theory, Series B.

Uppaluri Siva Ramachandra Murty or U. S. R. Murty (as he prefers to write his name), is a Professor Emeritus of the Department of Combinatorics and Optimization, University of Waterloo.U. S. R. Murty received his Ph.D. in 1967 from the Indian Statistical Institute, Calcutta, with a thesis on extremal graph theory. Murty is well known for his work in matroid theory and graph theory, and mainly for being a co-author with J. A. Bondy of a textbook on graph theory. Murty has served as a managing editor and co-editor-in-chief of the Journal of Combinatorial Theory, Series B.

Book Categories

Computer Science
45
Introduction to Computer Science
41
Algorithms and Data Structures
23
Object Oriented Programming
21
Theory of Computation
19
Formal Methods
19
Functional Programming
10
Logic Programming
22
Artificial Intelligence
22
Computer Vision
11
Big Data
3
Neural Networks
19
Compiler Design and Construction
1
Computer Security
15
Computer Organization and Architecture
5
Data Science
9
Parallel Computing
3
Concurrent Programming
22
Operating Systems
22
Data Communication and Networks
31
Information Security
6
Information Theory
23
Digital Libraries
13
Information Systems
61
Software Engineering
17
Game Development and Multimedia
10
Data Mining
22
Machine Learning

Mathematics
66
Mathematics
2
Precalculus
9
Algebra
6
Calculus
5
Category Theory
25
Linear Algebra
16
Computer Aided Mathematics
6
Proofs
16
Discrete Mathematics
6
Numerical Methods
3
Number Theory
10
Graph Theory
12
Operations Research
1
Complex Analysis
5
Queueing Theory
32
Statistics
10
Probability

Supporting Fields
9
Electric Circuits
22
Signal Processing
13
Web Design and Development
2
Document-oriented Database
9
Relational Database
1
Cloud Computing
1
Network Science

Operating System
Programming/Scripting
6
Ada
12
Assembly
35
C / C++
8
Common Lisp
2
Forth
34
Java
11
JavaScript
1
Lua
15
Microsoft .NET
1
Rexx
12
Perl
5
PHP
58
Python
1
Rebol
13
Ruby
2
Scheme
3
Tcl/Tk

Miscellaneous