Graph Theory for Programmers, Victor N. Kasyanov; Vladimir A. Evstigneev
Автор: Godsil Chris, Royle Gordon F. Название: Algebraic Graph Theory ISBN: 0387952411 ISBN-13(EAN): 9780387952413 Издательство: Springer Рейтинг: Цена: 75420.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Algebraic graph theory is a combination of two strands. The first is the study of algebraic objects associated with graphs. The second is the use of tools from algebra to derive properties of graphs. This work illustrates the main tools and ideas of algebraic graph theory.
Автор: Godsil Chris, Royle Gordon Название: Algebraic graph theory ISBN: 0387952209 ISBN-13(EAN): 9780387952208 Издательство: Springer Рейтинг: Цена: 37220.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book is primarily aimed at graduate students and researchers in graph theory, combinatorics, or discrete mathematics in general. However, all the necessary graph theory is developed from scratch, so the only pre-requisite for reading it is a first course in linear algebra and a small amount of elementary group theory. It should be accessible to motivated upper-level undergraduates.
Автор: Balakrishnan, V.k. Название: Schaum`s outline of graph theory ISBN: 0070054894 ISBN-13(EAN): 9780070054899 Издательство: McGraw-Hill Рейтинг: Цена: 29730.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Schaum`s Outlines present all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills.
Название: Basic graph theory. ISBN: 3319494740 ISBN-13(EAN): 9783319494746 Издательство: Springer Рейтинг: Цена: 41920.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This undergraduate textbook provides an introduction to graph theory, which has numerous applications in modeling problems in science and technology, and has become a vital component to computer science, computer science and engineering, and mathematics curricula of universities all over the world. The author follows a methodical and easy to understand approach. Beginning with the historical background, motivation and applications of graph theory, the author first explains basic graph theoretic terminologies.
From this firm foundation, the author goes on to present paths, cycles, connectivity, trees, matchings, coverings, planar graphs, graph coloring and digraphs as well as some special classes of graphs together with some research topics for advanced study. Filled with exercises and illustrations, Basic Graph Theory is a valuable resource for any undergraduate student to understand and gain confidence in graph theory and its applications to scientific research, algorithms and problem solving.
Автор: Gross Название: Handbook of Graph Theory, Second Edition ISBN: 1439880182 ISBN-13(EAN): 9781439880180 Издательство: Taylor&Francis Рейтинг: Цена: 219470.00 T Наличие на складе: Невозможна поставка. Описание: With 34 new contributors, this best-selling handbook provides comprehensive coverage of the main topics in pure and applied graph theory. This second edition incorporates 14 new sections. Each chapter includes lists of essential definitions and facts, accompanied by examples, tables, remarks, and, in some cases, conjectures and open problems.
Автор: Bolian Liu; Hong-Jian Lai Название: Matrices in Combinatorics and Graph Theory ISBN: 1441948341 ISBN-13(EAN): 9781441948342 Издательство: Springer Рейтинг: Цена: 153720.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Combinatorics and Matrix Theory have a symbiotic, or mutually beneficial, relationship. where an attempt was made to give a broad picture of the use of combinatorial ideas in matrix theory and the use of matrix theory in proving theorems which, at least on the surface, are combinatorial in nature.
Автор: Jin Akiyama; William Y.C. Chen; Mikio Kano; Xuelia Название: Discrete Geometry, Combinatorics and Graph Theory ISBN: 3540706658 ISBN-13(EAN): 9783540706656 Издательство: Springer Рейтинг: Цена: 65210.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book constitutes the thoroughly refereed post-proceedings of the 7th China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory, CJCDGCGT 2005, held in Tianjin, China, as well as in Xi`an, China, in November 2005. The 30 revised full papers address all current issues in discrete algorithmic geometry, combinatorics and graph theory.
This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course.
Just as with the first three editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs.
New to this edition are the Quick Check exercises at the end of each section. In all, the new edition contains about 240 new exercises. Extra examples were added to some sections where readers asked for them.
The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs, enumeration under group action, generating functions of labeled and unlabeled structures and algorithms and complexity.
The book encourages students to learn more combinatorics, provides them with a not only useful but also enjoyable and engaging reading.
The Solution Manual is available upon request for all instructors who adopt this book as a course text. Please send your request to sales@wspc.com.
The previous edition of this textbook has been adopted at various schools including UCLA, MIT, University of Michigan, and Swarthmore College. It was also translated into Korean.
Автор: Martin Charles Golumbic; Irith Ben-Arroyo Hartman Название: Graph Theory, Combinatorics and Algorithms ISBN: 1441937234 ISBN-13(EAN): 9781441937230 Издательство: Springer Рейтинг: Цена: 121110.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering.
Автор: K.M. Koh; H.P. Yap Название: Graph Theory Singapore 1983 ISBN: 3540133682 ISBN-13(EAN): 9783540133681 Издательство: Springer Рейтинг: Цена: 32560.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Harris John M. Название: Combinatorics and Graph Theory ISBN: 1441927239 ISBN-13(EAN): 9781441927231 Издательство: Springer Цена: 38150.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: There are certain rules that one must abide by in order to create a successful sequel. -- Randy Meeks, from the trailer to Scream 2 While we may not follow the precise rules that Mr. Meeks had in mind for s- cessful sequels, we have made a number of changes to the text in this second edition. In the new edition, we continue to introduce new topics with concrete - amples, we provide complete proofs of almost every result, and we preserve the book'sfriendlystyle andlivelypresentation, interspersingthetextwith occasional jokes and quotations. The rst two chapters, on graph theory and combinatorics, remain largely independent, and may be covered in either order. Chapter 3, on in nite combinatorics and graphs, may also be studied independently, although many readers will want to investigate trees, matchings, and Ramsey theory for nite sets before exploring these topics for in nite sets in the third chapter. Like the rst edition, this text is aimed at upper-division undergraduate students in mathematics, though others will nd much of interest as well. It assumes only familiarity with basic proof techniques, and some experience with matrices and in nite series. The second edition offersmany additionaltopics for use in the classroom or for independentstudy. Chapter 1 includesa new sectioncoveringdistance andrelated notions in graphs, following an expanded introductory section. This new section also introduces the adjacency matrix of a graph, and describes its connection to important features of the graph.
Автор: Hartmut Ehrig; Gregor Engels; Hans-J?rg Kreowski; Название: Theory and Application of Graph Transformations ISBN: 3540672036 ISBN-13(EAN): 9783540672036 Издательство: Springer Рейтинг: Цена: 83850.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This title incorporates 33 full papers addressing aspects of graph languages, graph theory, categorical approaches, concurrency and distribution, artificial intelligence, visual languages, specification concepts, modularity and refinements, and software engineering.
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
