Дискретная математика
Математика
  • формат pdf
  • размер 2.28 МБ
  • добавлен 12 января 2011 г.
Liu Yanpei. Introductory Map Theory
Kapa & Omega, Glendale, AZ, USA, 2010. - 503 p.
Abstract: A Smarandache system (G;R) is such a mathematical system with at least one Smarandachely denied rule r in R such that it behaves in at least two different ways within the same set G, i.e. , validated and invalided, or only invalided but in multiple distinct ways. A map is a 2-cell decomposition of surface, which can be seen as a connected graphs in development from partition to permutation, also a basis for constructing Smarandache systems, particularly, Smarandache 2-manifolds for Smarandache geometry. As an introductory book, this book contains the elementary materials in map theory, including embeddings of a graph, abstract maps, duality, orientable and non-orientable maps, isomorphisms of maps and the enumeration of rooted or unrooted maps, particularly, the joint tree representation of an embedding of a graph on two dimensional manifolds, which enables one to make the complication much simpler on map enumeration. All of these are valuable for researchers and students in combinatorics, graphs and low dimensional topology.

Contents:
Preface.
Chapter I Abstract Embeddings.
Chapter II Abstract Maps.
Chapter III Duality.
Chapter IV Orientability.
Chapter V Orientable Maps.
Chapter VI Nonorientable Maps.
Chapter VII Isomorphisms of Maps.
Chapter VIII Asymmetrization.
Chapter IX Rooted Petal Bundles.
Chapter X Asymmetrized Maps.
Chapter XI Maps with Symmetry.
Chapter XII Genus Polynomials.
Chapter XIII Census with Partitions.
Chapter XIV Super Maps of a Graph.
Chapter XV Equations with Partitions.
Appendix I Concepts of Polyhedra, Surfaces, Embeddings and Maps.
Appendix II Table of Genus Polynomials for Embeddings and Maps of Small Size.
Appendix III Atlas of Rooted and Unrooted Maps for Small Graphs.
Bibliography.
Terminology.
Похожие разделы
Смотрите также

Bollobas B. Modern Graph Theory

  • формат djvu
  • размер 9.99 МБ
  • добавлен 13 декабря 2010 г.
Springer, 1998. - 394 pages. The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The v...

Bona M. A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory

  • формат pdf
  • размер 18.89 МБ
  • добавлен 30 января 2011 г.
World Scientific Publishing Company, 2006. - 492 pages. 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 o...

Brualdi R.A. Introductory Combinatorics

  • формат pdf
  • размер 9.86 МБ
  • добавлен 29 января 2011 г.
Prentice Hall, 1998. - 614 pages. Introductory Combinatorics emphasizes combinatorial ideas, including the pigeon-hole principle, counting techniques, permutations and combinations, Polya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, and combinatortial structures (matchings, designs, graphs). Written to be entertaining and readable, this book's lively style reflects the author's jo...

Chartrand G., Lesniak L. Graphs and Digraphs

  • формат djvu
  • размер 2.67 МБ
  • добавлен 26 октября 2011 г.
Издательство Chapman and Hall/CRC Press, 1996, -429 pp. Graph theory is a major area of combinatorics, and during recent decades, graph theory has developed into a major area of mathematics. In addition to its growing interest and importance as a mathematical subject, it has applications to many fields, including computer science and chemistry. As in the first edition of Graphs & Digraphs (M. Behzad, G. Chartrand, L. Lesniak) and the second...

Desel J., Esparza J. Free Choice Petri Nets

  • формат djvu
  • размер 1.71 МБ
  • добавлен 31 января 2012 г.
Издательство Cambridge University Press, 1995, -254 pp. Free-choice Petri nets have been around for more than twenty years, and are a successful branch of net theory. Nearly all the introductory texts on Petri nets devote some pages to them. This book is intended for those who wish to go further. It brings together the classical theorems of free-choice theory obtained by Commoner and Hack in the seventies, and a selection of new results, like th...

Diestel R. Graph Theory

  • формат djvu
  • размер 2.43 МБ
  • добавлен 01 января 2011 г.
Springer, 2005. - 410 pages. The third edition of this standard textbook of modern graph theory has been carefully revised, updated, and substantially extended. Covering all its major recent developments it can be used both as a reliable textbook for an introductory course and as a graduate text: on each topic it covers all the basic material in full detail, and adds one or two deeper results (again with detailed proofs) to illustrate the more a...

Jech T. Set Theory

  • формат pdf
  • размер 14.36 МБ
  • добавлен 02 января 2011 г.
Springer, 2006. - 772 pages. Set Theory has experienced a rapid development in recent years, with major advances in forcing, inner models, large cardinals and descriptive set theory. The present book covers each of these areas, giving the reader an understanding of the ideas involved. It can be used for introductory students and is broad and deep enough to bring the reader near the boundaries of current research. Students and researchers in the...

Kisacanin B. Mathematical Problems and Proofs: Combinatorics, Number Theory, and Geometry

  • формат djvu
  • размер 1.31 МБ
  • добавлен 31 января 2012 г.
Kluwer Academic Publishers, 2002. - 220 pages. Key to Symbols. Set Theory. Sets and Elementary Set Operations. Cartesian Product and Relations. Functions and Operations. Cardinality. Problems. Combinatorics. Four Enumeration Principles. Introductory Problems. Basic Definitions. Generating Functions. Problems. Number Theory. Divisibility of Numbers. Important Functions in Number Theory. Congruences. Diophantine Equations. Problems. Geometry. Prope...

Linz P. An Introduction to Formal Languages and Automata

  • формат pdf
  • размер 20.96 МБ
  • добавлен 10 декабря 2011 г.
Jones & Bartlett Publishers, 2000. - 397 pages. This text covers all the material essential to an introductory theory of computation course for undergraduate students. The text has a solid mathematical base, and provides precise mathematical statements of theorems and definitions, giving an intuitive motivation for constructions and proofs. Proofs and arguments are clearly stated, without excessive mathematical detail, to help students und...

Matousek J., Nesetril J. Invitation to Discrete Mathematics

  • формат pdf
  • размер 19.68 МБ
  • добавлен 05 февраля 2011 г.
Oxford University Press, 1998. - 426 pages. Invitation to Discrete Mathematics is at once an introduction and a thoroughly comprehensive textbook for courses in combinatorics and graph theory. It also contains introductory chapters for more specialized courses such as probabilistic methods, applied linear algebra, combinatorial enumeration, and operations research. A lively and entertaining style is combined with rigorous mathematics, and the ma...