Автор: Gross Название: Handbook of Graph Theory, Second Edition ISBN: 1439880182 ISBN-13(EAN): 9781439880180 Издательство: Taylor&Francis Рейтинг: Цена: 34485 р. Наличие на складе: Невозможна поставка.
Описание:
In the ten years since the publication of the best-selling first edition, more than 1,000 graph theory papers have been published each year. Reflecting these advances, Handbook of Graph Theory, Second Edition provides comprehensive coverage of the main topics in pure and applied graph theory. This second edition--over 400 pages longer than its predecessor--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. A bibliography at the end of each chapter provides an extensive guide to the research literature and pointers to monographs. In addition, a glossary is included in each chapter as well as at the end of each section. This edition also contains notes regarding terminology and notation.
With 34 new contributors, this handbook is the most comprehensive single-source guide to graph theory. It emphasizes quick accessibility to topics for non-experts and enables easy cross-referencing among chapters.
Автор: Godsil Chris, Royle Gordon F. Название: Algebraic Graph Theory ISBN: 0387952411 ISBN-13(EAN): 9780387952413 Издательство: Springer Рейтинг: Цена: 12021 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Kandel Abraham, Bunke Horst, Last Mark Название: Applied Graph Theory in Computer Vision and Pattern Recognition ISBN: 3540680195 ISBN-13(EAN): 9783540680192 Издательство: Springer Рейтинг: Цена: 25244 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book will serve as a foundation for a variety of useful applications of graph theory to computer vision, pattern recognition, and related areas. It covers a representative set of novel graph-theoretic methods for complex computer vision and pattern recognition tasks. The first part of the book presents the application of graph theory to low-level processing of digital images such as a new method for partitioning a given image into a hierarchy of homogeneous areas using graph pyramids, or a study of the relationship between graph theory and digital topology. Part II presents graph-theoretic learning algorithms for high-level computer vision and pattern recognition applications, including a survey of graph based methodologies for pattern recognition and computer vision, a presentation of a series of computationally efficient algorithms for testing graph isomorphism and related graph matching tasks in pattern recognition and a new graph distance measure to be used for solving graph matching problems. Finally, Part III provides detailed descriptions of several applications of graph-based methods to real-world pattern recognition tasks. It includes a critical review of the main graph-based and structural methods for fingerprint classification, a new method to visualize time series of graphs, and potential applications in computer network monitoring and abnormal event detection.
Автор: Edited by Lowell W. Beineke Название: Topics in Algebraic Graph Theory ISBN: 0521801974 ISBN-13(EAN): 9780521801973 Издательство: Cambridge Academ Рейтинг: Цена: 18076 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The rapidly expanding area of algebraic graph theory uses two different branches of algebra to explore various aspects of graph theory: linear algebra (for spectral theory) and group theory (for studying graph symmetry). These areas have links with other areas of mathematics, such as logic and harmonic analysis, and are increasingly being used in such areas as computer networks where symmetry is an important feature. Other books cover portions of this material, but this book is unusual in covering both of these aspects and there are no other books with such a wide scope. Peter J. Cameron, internationally recognized for his substantial contributions to the area, served as academic consultant for this volume, and the result is ten expository chapters written by acknowledged international experts in the field. Their well-written contributions have been carefully edited to enhance readability and to standardize the chapter structure, terminology and notation throughout the book. To help the reader, there is an extensive introductory chapter that covers the basic background material in graph theory, linear algebra and group theory. Each chapter concludes with an extensive list of references.
Описание: This is a textbook for an introductory combinatorics course that can take up 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 edition, 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 for the talented and hard-working 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 and Eulerian and Hamiltonian cycles. The selected advanced
topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, and algorithms and complexity. As the goal of the book is to encourage students to learn
more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.
Описание: This is a textbook for an introductory combinatorics course that can take up 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 edition, 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 for the talented and hard-working 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 and Eulerian and Hamiltonian cycles. The selected advanced
topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, and algorithms and complexity.
As the goal of the book is to encourage
students to learn more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.
Название: Introduction to graph theory: h3 mathematics ISBN: 9812705252 ISBN-13(EAN): 9789812705259 Издательство: World Scientific Publishing Рейтинг: Цена: 19885 р. Наличие на складе: Поставка под заказ.
Описание: Graph theory is an area in discrete mathematics which studies configurations (called graphs) involving a set of vertices interconnected by edges. This book is
intended as a general introduction to graph theory and, in particular, as a resource book for junior college students and teachers reading and teaching the subject at H3 Level in the
new Singapore mathematics curriculum for junior college. The book builds on the verity that graph theory at this level is a subject that lends itself well to the development of
mathematical reasoning and proof.
Название: Introduction to graph theory: h3 mathematics ISBN: 9812703861 ISBN-13(EAN): 9789812703866 Издательство: World Scientific Publishing Рейтинг: Цена: 12473 р. Наличие на складе: Поставка под заказ.
Описание: Graph theory is an area in discrete mathematics which studies configurations (called graphs) involving a set of vertices interconnected by edges. This book is
intended as a general introduction to graph theory and, in particular, as a resource book for junior college students and teachers reading and teaching the subject at H3 Level in the
new Singapore mathematics curriculum for junior college. The book builds on the verity that graph theory at this level is a subject that lends itself well to the development of
mathematical reasoning and proof.
Автор: Foulds Название: Graph Theory Applications ISBN: 0387975993 ISBN-13(EAN): 9780387975993 Издательство: Springer Цена: 9348 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Offers an introduction to the theory of graphs and its application in engineering and science. The first part of this book covers the main graph theoretic topics and in the second part, these concepts are applied to problems in engineering, operations research, and science.
Автор: Golumbic Название: Graph Theory, Combinatorics and Algorithms ISBN: 038724347X ISBN-13(EAN): 9780387243474 Издательство: Springer Рейтинг: Цена: 17819 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering. This book focuses on problems such as Internet congestion control, high-speed communication networks, multi-object auctions, resource allocation, and more.
Автор: Harris Название: Combinatorics and Graph Theory ISBN: 0387987363 ISBN-13(EAN): 9780387987361 Издательство: Springer Цена: 6675 р. Наличие на складе: Нет в наличии.
Описание: This book evolved from several courses in combinatorics and graph theory given at Appalachian State University and UCLA. Chapter 1 focuses on finite graph
theory, including trees, planarity, coloring, matchings, and Ramsey theory. Chapter 2 studies combinatorics, including the principle of inclusion and exclusion, generating functions,
recurrence relations, Polya theory, the stable marriage problem, and several important classes of numbers.
Chapter 3 presents infinite pigeonhole principles, Konig's lemma,
and Ramsey's theorem, and discusses their connections to axiomatic set theory. The text is written in an enth
siastic and lively style. It includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics.
In addition, recent results
appear in the text, illustrating the fact that mathematics is a living discipline. The text is primarily directed toward upper-division undergraduate students, but lower-division
undergraduates with a penchant for proof and graduate students seeking an introduction to these subjects will also find much of interest.
Автор: Balakrishnan Название: A Textbook of Graph Theory ISBN: 0387988599 ISBN-13(EAN): 9780387988597 Издательство: Springer Цена: 8903 р. Наличие на складе: Нет в наличии.
Описание: Graph theory has experienced a tremendous growth during the 20th century. One of the main reasons for this phenomenon is the applicability of graph theory
in other disciplines such as physics, chemistry, psychology, sociology, and theoretical computer science. This book aims to provide a solid background in the basic topics of graph
theory.
It covers Dirac's theorem on k-connected graphs, Harary-Nashwilliam's theorem on the hamiltonicity of line graphs, Toida-McKee's characterization of Eulerian graphs,
the Tutte matrix of a graph, Fournier's proof of Kuratowski's theorem on planar graphs, the proof of the nonhamiltonicity of the Tutte graph on 46 vertices and a concrete application of
triangulated graphs. The book does not presuppose deep knowledge of any branch of mathematics, but requires only the basics of mathematics. It
can be used in an advanced undergraduate course or a beginning graduate course in graph theory.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
