Graph theory
By: Chatterjee, D.
Publisher: New Delhi Narosa Publishing House 2022Edition: 1st.Description: xii, 232p. | Binding - Paperback | 23.5*15.2 cm.ISBN: 9788184877274.Subject(s): FE-MATHEMATICSDDC classification: 511.5 Summary: About the book An excellent introduction to graph theory, this book covers all relevant concepts in a lucid and rigorous manner. Apart from basic concepts such as tree, isomorphism, transversal, colouring, networks and matching, the notion of matroids has been covered. Special characteristics of this book on graph theory are algorithms provided for each applicable feature such as shortest path between two vertices, connectivity of a graph, minimal spanning tree of a graph and maximum flow in a network. Thereby making it a useful text for students of computer science, information technology, mathematics and statistics. Key Features • Algorithms explained in a lucid manner • Several worked out examples to understand the concepts and techniques Table of Contents Preface / Algebraic Prerequisites / Graphs and Subgraphs / Special Graphs / Connectivity and Trees / Planar Graphs / Digraphs / Matching / Algorithms / Applications / Bibliography.Item type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
Text Books | School of Engineering & Technology Reference Section | Reference | 511.5 CHA (Browse shelf) | Available | E15944 |
Browsing School of Engineering & Technology Shelves , Shelving location: Reference Section , Collection code: Reference Close shelf browser
No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | ||||
511.1 SIN Discrete Mathematical Structures | 511.1 TRE/MAN Discreate Mathematical Structures With Application to Computer Science | 511.5 ALD/WIL Graphs And Application | 511.5 CHA Graph theory | 511.5 WES Introduction to Graph Theory | 512 ART Algebra | 512.02 SHE Abstract algebra |
About the book
An excellent introduction to graph theory, this book covers all relevant concepts in a lucid and rigorous manner. Apart from basic concepts such as tree, isomorphism, transversal, colouring, networks and matching, the notion of matroids has been covered. Special characteristics of this book on graph theory are algorithms provided for each applicable feature such as shortest path between two vertices, connectivity of a graph, minimal spanning tree of a graph and maximum flow in a network. Thereby making it a useful text for students of computer science, information technology, mathematics and statistics.
Key Features
• Algorithms explained in a lucid manner • Several worked out examples to understand the concepts and techniques
Table of Contents
Preface / Algebraic Prerequisites / Graphs and Subgraphs / Special Graphs / Connectivity and Trees / Planar Graphs / Digraphs / Matching / Algorithms / Applications / Bibliography.
There are no comments for this item.