A Textbook of Graph Theory [electronic resource] / by R. Balakrishnan, K. Ranganathan.

By: Balakrishnan, R [author.]
Contributor(s): Ranganathan, K [author.] | SpringerLink (Online service)
Material type: TextTextSeries: Universitext: Publisher: New York, NY : Springer New York : Imprint: Springer, 2012Edition: 2nd ed. 2012Description: XIII, 292 p. 204 illus. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9781461445296Subject(s): Mathematics | Graph theory | Mathematics | Graph TheoryAdditional physical formats: Printed edition:: No titleDDC classification: 511.5 LOC classification: QA166-166.247Online resources: Click here to access online
Contents:
Preface to the Second Edition -- Preface to the First Edition -- 1 Basic Results -- 2 Directed Graphs -- 3 Connectivity -- 4 Trees -- 5 Independent Sets and Matchings -- 6 Eulerian and Hamiltonian Graphs -- 7 Graph Colorings -- 8 Planarity -- 9 Triangulated Graphs -- 10 Domination in Graphs -- 11 Spectral Properties of Graphs -- Bibliography -- Index.
In: Springer eBooksSummary: Graph theory experienced a tremendous growth in the 20th century. One of the main reasons for this phenomenon is the applicability of graph theory in other disciplines such as physics, chemistry, psychology, sociology, and theoretical computer science. This textbook provides a solid background in the basic topics of graph theory, and is intended for an advanced undergraduate or beginning graduate course in graph theory.   This second edition includes two new chapters: one on domination in graphs and the other on the spectral properties of graphs, the latter including a discussion on graph energy.  The chapter on graph colorings has been enlarged, covering additional topics such as homomorphisms and colorings and the uniqueness of the Mycielskian up to isomorphism.  This book also introduces several interesting topics such as Dirac's theorem on k-connected graphs, Harary-Nashwilliam's theorem on the hamiltonicity of line graphs, Toida-McKee's characterization of Eulerian graphs, the Tutte matrix of a graph, Fournier's proof of Kuratowski's theorem on planar graphs, the proof of the nonhamiltonicity of the Tutte graph on 46 vertices, and a concrete application of triangulated graphs.
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
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Preface to the Second Edition -- Preface to the First Edition -- 1 Basic Results -- 2 Directed Graphs -- 3 Connectivity -- 4 Trees -- 5 Independent Sets and Matchings -- 6 Eulerian and Hamiltonian Graphs -- 7 Graph Colorings -- 8 Planarity -- 9 Triangulated Graphs -- 10 Domination in Graphs -- 11 Spectral Properties of Graphs -- Bibliography -- Index.

Graph theory experienced a tremendous growth in the 20th century. One of the main reasons for this phenomenon is the applicability of graph theory in other disciplines such as physics, chemistry, psychology, sociology, and theoretical computer science. This textbook provides a solid background in the basic topics of graph theory, and is intended for an advanced undergraduate or beginning graduate course in graph theory.   This second edition includes two new chapters: one on domination in graphs and the other on the spectral properties of graphs, the latter including a discussion on graph energy.  The chapter on graph colorings has been enlarged, covering additional topics such as homomorphisms and colorings and the uniqueness of the Mycielskian up to isomorphism.  This book also introduces several interesting topics such as Dirac's theorem on k-connected graphs, Harary-Nashwilliam's theorem on the hamiltonicity of line graphs, Toida-McKee's characterization of Eulerian graphs, the Tutte matrix of a graph, Fournier's proof of Kuratowski's theorem on planar graphs, the proof of the nonhamiltonicity of the Tutte graph on 46 vertices, and a concrete application of triangulated graphs.

There are no comments for this item.

to post a comment.

Powered by Koha