An introduction to graph theory (Record no. 3841)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03564nam a2200181 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9788173717604 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | CUS |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 006.6 |
| Item number | PIR/I |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Pirzada, S. |
| 245 ## - TITLE STATEMENT | |
| Title | An introduction to graph theory |
| Statement of responsibility, etc. | S. Pirzada |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | Hyderabad: |
| Name of publisher, distributor, etc. | University Press, |
| Date of publication, distribution, etc. | 2009. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | viii, 396 p. |
| Other physical details | ill. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc | Include references and index. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 1. Introduction<br/>1.1 Basic Concepts<br/>1.2 Degrees<br/>1.3 Isomorphism<br/>1.4 Types of Graphs<br/>1.5 Graph Properties<br/>1.6 Paths, Cycles and Components<br/>1.7 Operations on Graphs<br/>1.8 Topological Operations<br/>1.9 Distance and Eccentricity<br/>1.10 Exercises<br/>2. Degree Sequences<br/>2.1 Degree Sequences<br/>2.2 Criteria for Degree Sequences<br/>2.3 Degree Set of a Graph<br/>2.4 New Criterion<br/>2.5 Equivalence of Seven Criteria<br/>2.6 Signed Graphs<br/>2.7 Exercises<br/>3. Eulerian and Hamiltonian Graphs<br/>3.1 Euler, Graphs<br/>3.2 Konigsberg Bridge Problem<br/>3.3 Unicursal Graphs<br/>3.4 Arbitrarily Traceable Graphs<br/>3.5 Sub-Eulerian Graphs<br/>3.6 Hamiltonian Graphs<br/>3.7 Pancyclic Graphs<br/>3.8 Exercises<br/>4. Trees<br/>4.1 Basics<br/>4.2 Rooted and Binary Trees<br/>4.3 Number of Labelled Trees<br/>4.4 The Fundamental Cycles<br/>4.5 Generation of Trees<br/>4.6 Helly Property<br/>4.7 Signed Trees<br/>4.8 Exercises<br/>5. Connectivity<br/>5.1 Basic Concepts<br/>5.2 Block-Cut Vertex Tree<br/>5.3 Connectivity Parameters<br/>5.4 Menger's Theorem<br/>5.5 Some Properties of a Bond<br/>5.6 Fundamental Bonds<br/>5.7 Block Graphs and Cut Vertex Graphs<br/>5.8 Exercises<br/>6. Planarity<br/>6.1 Kuratowski's two graphs<br/>6.2 Region<br/>6.3 Euler's Theorem<br/>6.4 Kuratowski's theorem<br/>6.5 Geometric Dual<br/>6.6 Polyhedron<br/>6.7 Decomposition of Some Planar Graphs<br/>6.8 Exercises<br/>7. Colourings<br/>7.1 Vertex Colouring<br/>12 Critical Graphs<br/>7.3 Brooks Theorem<br/>7.4 Edge Colouring<br/>7.5 Region Colouring (Map Coloring)<br/>7.6 Heawood Map-Colouring Theorem<br/>7.7 Uniquely Colourable Graphs<br/>7.8 Hajos Conjecture<br/>7.9 Exercises<br/>8. Matchings and Factors<br/>8.1 Matchings<br/>8.2 Factors<br/>8.3 Antifactor Sets<br/>8.4 The /-factor Theorem<br/>8.5 Degree Factors<br/>8.6 (g, f) and [a, b]-factors<br/>8.7 Exercises<br/>9. Edge Graphs and Eccentricity Sequences<br/>9.1 Edge Graphs<br/>9.2 Edge Graphs and Traversability<br/>9.3 Total Graphs<br/>9.4 Eccentricity Sequences and Sets<br/>9.5 Distance Degree Regular and Distance Regular Graphs<br/>9.6 Isometry<br/>9.7 Exercises<br/>10. Graph Ma^trices<br/>10.1 Incidence Matrix<br/>10.2 Submatrices of A(G)<br/>10.3 Cycle Matrix<br/>10.4 Cut-Set Matrix<br/>10.5 Fundamental Cut Set Matrix<br/>10.6 Relations between A/, Bf and C/<br/>10.7 Path Matrix<br/>10.8 Adjacency Matrix<br/>10.9 Exercises<br/>11. Digraphs<br/>11.1 Basic Definitions ,<br/>11.2 Digraphs Mid Binary Relations .<br/>11.3 Directed Paths and Connectedness <br/>11.4 Buler Digraphs<br/>11.5 Hamiltonian Digraphs <br/>11.6 Trees with Directed Edges<br/>11.7 Matrices A, B and C of Digraphs<br/>11.8 Number of Arborescences<br/>11.9 Tournaments<br/>11.10 Exercises<br/>12. Score Structure in Digraphs<br/>12.1 Score Sequences in Tournaments<br/>12.2 Frequency Sets in Tournaments<br/>12.3 Score Sets in Tournaments<br/>12.4 Lexicographic Enumeration and Tournament Construction<br/>12.5 Simple Score Sequences in Tournaments<br/>12.6 Score Sequences of Self-Converse Tournaments .<br/>12.7 Score Sequences of Bipartite Tournaments<br/>12.8 Uniquely Realisable (simple) Pairs of Score Sequences<br/>12.9 Score Sequences of Oriented Graphs<br/>12.10 Score Sets in Oriented Graphs<br/>12.11 Uniquely Realisable (simple) Score Sequences in Oriented Graphs<br/>12.12 Score Sequences in Oriented Bipartite Graphs<br/>12.13 Score Sequences of Semi Complete Digraphs<br/>12.14 Exercises<br/> |
| 650 ## - SUBJECT | |
| Keyword | Isomorphism |
| 650 ## - SUBJECT | |
| Keyword | Graph |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | GN Books |
| Withdrawn status | Lost status | Damaged status | Not for loan | Home library | Current library | Shelving location | Date acquired | Full call number | Accession number | Date last seen | Date last checked out | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Central Library, Sikkim University | Central Library, Sikkim University | General Book Section | 28/06/2016 | 006.6 PIR/I | P43721 | 16/03/2020 | 16/03/2020 | General Books |