Автор: 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.
Описание: Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas`s well-known 1985 book.
Описание: This book covers application of graph theory for efficient analysis; the force method extended to finite element analysis; meta-heuristic algorithms applied to ordering; efficient use of symmetry and regularity in structural analysis by force method; and more.
Описание: This book covers application of graph theory for efficient analysis; the force method extended to finite element analysis; meta-heuristic algorithms applied to ordering; efficient use of symmetry and regularity in structural analysis by force method; and more.
Автор: Michael A. Henning; Anders Yeo Название: Total Domination in Graphs ISBN: 1489991565 ISBN-13(EAN): 9781489991560 Издательство: Springer Рейтинг: Цена: 13275.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book explores the fundamentals of total domination in graphs, the interplay with transversals in hypergraphs and the association with diameter-2-critical graphs. Includes several proofs, and a toolbox of proof techniques for attacking open problems.
Автор: Georg Polya; Dorothee Aeppli; R.C. Read Название: Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds ISBN: 1461291054 ISBN-13(EAN): 9781461291053 Издательство: Springer Рейтинг: Цена: 11173.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: In 1937 there appeared a paper that was to have a profound influence on the progress of combinatorial enumeration, both in its theoretical and applied aspects. Entitled Kombinatorische Anzahlbest- immungen jUr Gruppen, Graphen und chemische Verbindungen, it was published in Acta Mathematica, Vol. 68, pp. 145 to 254. Its author, George Polya, was already a mathematician of considerable stature, well-known for outstanding work in many branches of mathematics, particularly analysis. The paper in Question was unusual in that it depended almost entirely on a single theorem -- the "Hauptsatz" of Section 4 -- a theorem which gave a method for solving a general type of enumera- tion problem. On the face of it, this is not something that one would expect to run to over 100 pages. Yet the range of the applica- tions of the theorem and of its ramifications was enormous, as Polya clearly showed. In the various sections of his paper he explored many applications to the enumeration of graphs, principally trees, and of chemical isomers, using his theorem to present a comprehen- sive and unified treatment of problems which had previously been solved, if at all, only by ad hoc methods. In the final section he investigated the asymptotic properties of these enumerational results, bringing to bear his formidable insight as an analyst.
Автор: 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.
Автор: Futaba Fujie; Ping Zhang Название: Covering Walks in Graphs ISBN: 1493903047 ISBN-13(EAN): 9781493903047 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Covering Walks in Graphs is aimed at researchers and graduate students in the graph theory community and provides a comprehensive treatment on measures of two well studied graphical properties, namely Hamiltonicity and traversability in graphs.
Автор: Joel Spencer Название: The Strange Logic of Random Graphs ISBN: 3642074995 ISBN-13(EAN): 9783642074998 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: 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
