| 000 | 01993nam a2200277Ia 4500 | ||
|---|---|---|---|
| 003 | OSt | ||
| 005 | 20251230142935.0 | ||
| 008 | 220909b |||||||| |||| 00| 0 eng d | ||
| 020 | _a9788181288141 | ||
| 037 | _cTextual | ||
| 040 |
_aCSL _beng _cCSL |
||
| 041 | _aeng | ||
| 084 |
_aB44, P0;2 _qCSL |
||
| 100 |
_aBalakrishnan, R. _eauthor. _9860377 |
||
| 245 | 0 | _aTextbook of Graph Theory | |
| 260 |
_aNew York: _bSpringer, _c2000. |
||
| 300 |
_axi, 227p. _b: ill. |
||
| 500 | _aReferences 217-222p.; Index 223-227p.; Reprint 2013. | ||
| 520 | _a About the Book:- Graph theory has experienced a tremendous growth during 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 book aims to provide a solid background in the basic topics of graph theory. It covers 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. The book does not presuppose deep knowledge of any branch of mathematics, but requires only the basics of mathematics. It can be used in an advanced undergraduate course or a beginning graduate course in graph theory. Contents:- Basic Results.- Directed Graphs.- Connectivity.- Trees.- Independent Sets and Matchings.- Eulerian and Hamiltonian Graphs.- Graph Colourings.- Planarity.- Triangulated Graphs.- Applications. | ||
| 650 |
_a Graph colorings _9860378 |
||
| 650 |
_a Triangulated _9860379 |
||
| 650 |
_aConnectivity _9860380 |
||
| 700 |
_aRanganathan, K. _9860381 |
||
| 942 |
_hB44, P0;2 _cTEXL _2CC _n0 |
||
| 999 |
_c14679 _d14679 |
||