Elementary Number Theory, Group Theory and Ramanujan Graphs, Davidoff
Автор: Chartrand Gary Название: Graphs & Digraphs ISBN: 1498735762 ISBN-13(EAN): 9781498735766 Издательство: Taylor&Francis Рейтинг: Цена: 16078.00 р. Наличие на складе: Поставка под заказ.
Описание:
Graphs & Digraphs masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, theorems, history, and applications of graph theory.
Fully updated and thoughtfully reorganized to make reading and locating material easier for instructors and students, the Sixth Edition of this bestselling, classroom-tested text:
Adds more than 160 new exercises
Presents many new concepts, theorems, and examples
Includes recent major contributions to long-standing conjectures such as the Hamiltonian Factorization Conjecture, 1-Factorization Conjecture, and Alspach's Conjecture on graph decompositions
Supplies a proof of the perfect graph theorem
Features a revised chapter on the probabilistic method in graph theory with many results integrated throughout the text
At the end of the book are indices and lists of mathematicians' names, terms, symbols, and useful references. There is also a section giving hints and solutions to all odd-numbered exercises. A complete solutions manual is available with qualifying course adoption.
Graphs & Digraphs, Sixth Edition remains the consummate text for an advanced undergraduate level or introductory graduate level course or two-semester sequence on graph theory, exploring the subject's fascinating history while covering a host of interesting problems and diverse applications.
Автор: Ceccherini-Silberstein Название: Groups, Graphs and Random Walks ISBN: 1316604403 ISBN-13(EAN): 9781316604403 Издательство: Cambridge Academ Рейтинг: Цена: 11880.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: An accessible and panoramic account of the theory of random walks on groups and graphs, stressing the connections with other branches of mathematics. Covering topics from growth and amenability of groups, Schroedinger operators, and Poisson boundaries, this book provides a valuable and up-to-date reference for both researchers and graduates.
Автор: Barlow Название: Random Walks and Heat Kernels on Graphs ISBN: 1107674425 ISBN-13(EAN): 9781107674424 Издательство: Cambridge Academ Рейтинг: Цена: 9186.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This introduction to random walks on infinite graphs, in both discrete and continuous time, gives a systematic account of transition densities, including useful but hard-to-find results. The book is aimed at researchers and graduate students in mathematics who have a basic familiarity with analysis and some familiarity with probability.
Автор: Li Название: Generalized Connectivity of Graphs ISBN: 3319338277 ISBN-13(EAN): 9783319338279 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.
Автор: Kocay William Название: Graphs, Algorithms, and Optimization ISBN: 1482251167 ISBN-13(EAN): 9781482251166 Издательство: Taylor&Francis Рейтинг: Цена: 12554.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. We have also included a discussion on linear programming that emphasizes problems in graph theory. The text is suitable for students in computer science or mathematics programs.
Автор: Cooper Shaun Et Al Название: Development Of Elliptic Functions According To Ramanujan ISBN: 9814366455 ISBN-13(EAN): 9789814366458 Издательство: World Scientific Publishing Рейтинг: Цена: 11246.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Provides an efficient approach to elliptic functions, based on the ideas of the great Indian mathematician Srinivasa Ramanujan. This book is suitable for graduate students and researchers in Number Theory and Classical Analysis, as well for scholars and aficionados of Ramanujan`s work.
Описание: This book shows how the ADE Coxeter graphs unify at least 20 different types of mathematical structures. These mathematical structures are of great utility in unified field theory, string theory, and other areas of physics.
Автор: Hammack Название: Handbook Of Product Graphs 2E ISBN: 1138199087 ISBN-13(EAN): 9781138199088 Издательство: Taylor&Francis Рейтинг: Цена: 7961.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Handbook of Product Graphs, Second Edition examines the dichotomy between the structure of products and their subgraphs. It also features the design of efficient algorithms that recognize products and their subgraphs and explores the relationship between graph parameters of the product and factors. Extensively revised and expanded, the handbook presents full proofs of many important results as well as up-to-date research and conjectures.
Results and Algorithms New to the Second Edition:
Cancellation results
A quadratic recognition algorithm for partial cubes
Results on the strong isometric dimension
Computing the Wiener index via canonical isometric embedding
Connectivity results
A fractional version of Hedetniemi's conjecture
Results on the independence number of Cartesian powers of vertex-transitive graphs
Verification of Vizing's conjecture for chordal graphs
Results on minimum cycle bases
Numerous selected recent results, such as complete minors and nowhere-zero flows
The second edition of this classic handbook provides a thorough introduction to the subject and an extensive survey of the field. The first three parts of the book cover graph products in detail. The authors discuss algebraic properties, such as factorization and cancellation, and explore interesting and important classes of subgraphs. The fourth part presents algorithms for the recognition of products and related classes of graphs. The final two parts focus on graph invariants and infinite, directed, and product-like graphs. Sample implementations of selected algorithms and other information are available on the book's website, which can be reached via the authors' home pages.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
