| 000 -LEADER |
|---|
| fixed length control field |
nam a22 4500 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
240404b xxu||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9789811273100 |
| Terms of availability |
hbk. |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
511.5 |
| Item number |
GRI |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Griffin, Christopher |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Applied graph theory : an introduction with graph optimization and algebraic graph theory |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Name of publisher, distributor, etc |
World scientific, |
| Date of publication, distribution, etc |
2023 |
| Place of publication, distribution, etc |
New Jersey : |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xxi, 282 p. ; |
| Other physical details |
ill., |
| Dimensions |
24 cm. |
| 365 ## - TRADE PRICE |
|---|
| Price amount |
98.00 |
| Price type code |
$ |
| Unit of pricing |
86.30 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes bibliographical references and index. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
This book serves as an introduction to graph theory and its applications. It is intended for a senior undergraduate course in graph theory but is also appropriate for beginning graduate students in science or engineering. The book presents a rigorous (proof-based) introduction to graph theory while also discussing applications of the results for solving real-world problems of interest. The book is divided into four parts. Part 1 covers the combinatorial aspects of graph theory including a discussion of common vocabulary, a discussion of vertex and edge cuts, Eulerian tours, Hamiltonian paths and a characterization of trees. This leads to Part 2, which discusses common combinatorial optimization problems. Spanning trees, shortest path problems and matroids are all discussed, as are maximum flow problems. Part 2 ends with a discussion of graph coloring and a proof of the NP-completeness of the coloring problem. Part 3 introduces the reader to algebraic graph theory, and focuses on Markov chains, centrality computation (e.g., eigenvector centrality and page rank), as well as spectral graph clustering and the graph Laplacian. Part 4 contains additional material on linear programming, which is used to provide an alternative analysis of the maximum flow problem. Two appendices containing prerequisite material on linear algebra and probability theory are also provided. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Graph theory |
|
|---|
| Topical term or geographic name as entry element |
Degree sequences |
|
|---|
| Topical term or geographic name as entry element |
Subgraphs |
|
|---|
| Topical term or geographic name as entry element |
Fields |
|
|---|
| Topical term or geographic name as entry element |
Vector space |
|
|---|
| Topical term or geographic name as entry element |
Matrices |
|
|---|
| Topical term or geographic name as entry element |
Linear programming |
|
|---|
| Topical term or geographic name as entry element |
Probability theory |
|
|---|
| Topical term or geographic name as entry element |
Max flow |
|
|---|
| Topical term or geographic name as entry element |
Min cut |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
Books |