Normal view MARC view ISBD view

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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
 Text Books Text Books School of Engineering & Technology
Reference Section
Reference 511.5 CHA (Browse shelf) Available E15944
Total holds: 0

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.

Log in to your account to post a comment.

Click on an image to view it in the image viewer

Unique Visitors hit counter Total Page Views free counter
Implemented and Maintained by AIKTC-KRRC (Central Library).
For any Suggestions/Query Contact to library or Email: librarian@aiktc.ac.in | Ph:+91 22 27481247
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha