| Titre : |
A First Course in Graph Theory and Combinatorics |
| Type de document : |
texte imprimé |
| Auteurs : |
Sebastian M. Cioabă, Auteur ; M. Ram Murty, Auteur |
| Mention d'édition : |
Second edition |
| Editeur : |
New dehli [India] : Springer Verlag |
| Année de publication : |
2022 |
| Autre Editeur : |
New dehli [India] : HINDUSTAN BOOK AGENCY |
| Importance : |
222p. |
| Présentation : |
couv:ill. |
| Format : |
20cm. |
| ISBN/ISSN/EAN : |
978-981-19136-2-4 |
| Langues : |
Anglais (eng) |
| Catégories : |
51 Mathématiques :519.1 Analyse combinatoire Théorie des graphies
|
| Tags : |
Graph , Matrice |
| Index. décimale : |
519.17 |
| Résumé : |
This book discusses the origin of graph theory from its humble beginnings in recreational mathematics to its modern setting or modeling communication networks, as is evidenced by the World Wide Web graph used by many Internet search engines. The second edition of the book includes recent developments in the theory of signed adjacency matrices involving the proof of sensitivity conjecture and the theory of Ramanujan graphs. In addition, the book discusses topics such as Pick's theorem on areas of lattice polygons and Graham-Pollak's work on addressing of graphs. The concept of graph is fundamental in mathematics and engineering, as it conveniently encodes diverse relations and facilitates combinatorial analysis of many theoretical and practical problems. The text is ideal for a one-semester course at the advanced undergraduate level or beginning graduate level. |
A First Course in Graph Theory and Combinatorics [texte imprimé] / Sebastian M. Cioabă, Auteur ; M. Ram Murty, Auteur . - Second edition . - New dehli [India] : Springer Verlag : New dehli [India] : HINDUSTAN BOOK AGENCY, 2022 . - 222p. : couv:ill. ; 20cm. ISBN : 978-981-19136-2-4 Langues : Anglais ( eng)
| Catégories : |
51 Mathématiques :519.1 Analyse combinatoire Théorie des graphies
|
| Tags : |
Graph , Matrice |
| Index. décimale : |
519.17 |
| Résumé : |
This book discusses the origin of graph theory from its humble beginnings in recreational mathematics to its modern setting or modeling communication networks, as is evidenced by the World Wide Web graph used by many Internet search engines. The second edition of the book includes recent developments in the theory of signed adjacency matrices involving the proof of sensitivity conjecture and the theory of Ramanujan graphs. In addition, the book discusses topics such as Pick's theorem on areas of lattice polygons and Graham-Pollak's work on addressing of graphs. The concept of graph is fundamental in mathematics and engineering, as it conveniently encodes diverse relations and facilitates combinatorial analysis of many theoretical and practical problems. The text is ideal for a one-semester course at the advanced undergraduate level or beginning graduate level. |
|  |
Accueil
Faire une suggestion Affiner la recherche
