A textbook of graph theory / R. Balakrishnan, K. Ranganathan

Auteur: Balakrishnan, Rangaswami - AuteurCo-auteur: Ranganathan, Krishnachar - AuteurType de document: Livre numériqueCollection: Universitext, (Online)Langue: anglaisÉditeur: New York : Springer, 2012 ISBN: 9781461445296 Note: From the publisher's description: "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.'' Sujets MSC: 05-01 Combinatorics -- Instructional exposition (textbooks, tutorial papers, etc.)
05Cxx Combinatorics -- Graph theory
En-ligne: Springerlink | Zentralblatt

No physical items for this record


From the publisher's description: "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.

Log in to your account to post a comment.
Languages: English | Français | |