Bond Graphs for Modelling, Control and Fault Diagnosis of Engineering Systems, Wolfgang Borutzky
Автор: 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.
Автор: 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.
Автор: Arie Koster; Xavier Mu?oz Название: Graphs and Algorithms in Communication Networks ISBN: 3642261639 ISBN-13(EAN): 9783642261633 Издательство: Springer Рейтинг: Цена: 23058.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Examining communication networks from a mathematical perspective, this volume offers an introductory overview of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption.
Автор: 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.
Автор: Coolen A.C.C. Название: Generating Random Networks and Graphs ISBN: 0198709897 ISBN-13(EAN): 9780198709893 Издательство: Oxford Academ Рейтинг: Цена: 11246.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book describes how to correctly and efficiently generate random networks based on certain constraints. Being able to test a hypothesis against a properly specified control case is at the heart of the `scientific method`.
Автор: Hofstad Название: Random Graphs and Complex Networks ISBN: 110717287X ISBN-13(EAN): 9781107172876 Издательство: Cambridge Academ Рейтинг: Цена: 8237.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Network science is one of the fastest growing areas in science and business. This classroom-tested, self-contained book is designed for master`s-level courses and provides a rigorous treatment of random graph models for networks, featuring many examples of real-world networks for motivation and numerous exercises to build intuition and experience.
Автор: 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
