The Leading eBooks Store Online

3,725,826 members ⚫ 1,209,635 ebooks

New to eBooks.com?

Learn more
Browse our categories
  • Bestsellers - This Week
  • Foreign Language Study
  • Pets
  • Bestsellers - Last 6 months
  • Games
  • Philosophy
  • Archaeology
  • Gardening
  • Photography
  • Architecture
  • Graphic Books
  • Poetry
  • Art
  • Health & Fitness
  • Political Science
  • Biography & Autobiography
  • History
  • Psychology & Psychiatry
  • Body Mind & Spirit
  • House & Home
  • Reference
  • Business & Economics
  • Humor
  • Religion
  • Children's & Young Adult Fiction
  • Juvenile Nonfiction
  • Romance
  • Computers
  • Language Arts & Disciplines
  • Science
  • Crafts & Hobbies
  • Law
  • Science Fiction
  • Current Events
  • Literary Collections
  • Self-Help
  • Drama
  • Literary Criticism
  • Sex
  • Education
  • Literary Fiction
  • Social Science
  • The Environment
  • Mathematics
  • Sports & Recreation
  • Family & Relationships
  • Media
  • Study Aids
  • Fantasy
  • Medical
  • Technology
  • Fiction
  • Music
  • Transportation
  • Folklore & Mythology
  • Nature
  • Travel
  • Food and Wine
  • Performing Arts
  • True Crime
  • Foreign Language Books
Graph theory

Most popular at the top

  • Spanning Tree Results for Graphs and Multigraphsby Daniel J. Gross; John T. Saccoman; Charles L. Suffel

    World Scientific Publishing Company 2014; US$ 68.00 US$ 61.88

    This book is concerned with the optimization problem of maximizing the number of spanning trees of a multigraph. Since a spanning tree is a minimally connected subgraph, graphs and multigraphs having more of these are, in some sense, immune to disconnection by edge failure. We employ a matrix-theoretic approach to the calculation of the number of spanning... more...

  • Graphical Enumerationby Frank Harary; Edgar M. Palmer

    Elsevier Science 2014; US$ 72.95

    Graphical Enumeration deals with the enumeration of various kinds of graphs. Topics covered range from labeled enumeration and George Pólya's theorem to rooted and unrooted trees, graphs and digraphs, and power group enumeration. Superposition, blocks, and asymptotics are also discussed. A number of unsolved enumeration problems are presented. Comprised... more...

  • Systems Dependability Assessmentby Jean-Francois Aubry; Nicolae Brinzei

    Wiley 2015; US$ 78.00 US$ 67.60

    Presents recent developments of probabilistic assessment of systems dependability based on stochastic models, including graph theory, finite state automaton and language theory, for both dynamic and hybrid contexts. more...

  • Zero-Symmetric Graphsby H. S. M. Coxeter; Roberto Frucht; David L. Powers

    Elsevier Science 2014; US$ 31.95

    Zero-Symmetric Graphs: Trivalent Graphical Regular Representations of Groups describes the zero-symmetric graphs with not more than 120 vertices.The graphs considered in this text are finite, connected, vertex-transitive and trivalent. This book is organized into three parts encompassing 25 chapters. The first part reviews the different classes of... more...

  • Graph Theory and Computingby Ronald C. Read

    Elsevier Science 2014; US$ 72.95

    Graph Theory and Computing focuses on the processes, methodologies, problems, and approaches involved in graph theory and computer science. The book first elaborates on alternating chain methods, average height of planted plane trees, and numbering of a graph. Discussions focus on numbered graphs and difference sets, Euclidean models and complete... more...

  • Least Action Principle Of Crystal Formation Of Dense Packing Type And Kepler's Conjectureby W Y Hsiang

    World Scientific Publishing Company 2001; US$ 100.00 US$ 91.00

    The dense packing of microscopic spheres (i.e. atoms) is the basic geometric arrangement in crystals of mono-atomic elements with weak covalent bonds, which achieves the optimal "known density" of p/√18. In 1611, Johannes Kepler had already "conjectured" that p/√18 should be the optimal "density" of sphere packings. Thus, the central problems... more...

  • Graph Separators, with Applicationsby Arnold L. Rosenberg; Lenwood S. Heath

    Springer US 2006; US$ 126.87

    Graph Separators with Applications is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. The book surveys the main approaches to obtaining good graph separations, while the main focus of the book is on techniques for deriving lower bounds... more...

  • Random Graphs for Statistical Pattern Recognitionby David J. Marchette

    Wiley 2005; US$ 160.00 US$ 138.67

    A timely convergence of two widely used disciplines Random Graphs for Statistical Pattern Recognition is the first book to address the topic of random graphs as it applies to statistical pattern recognition. Both topics are of vital interest to researchers in various mathematical and statistical fields and have never before been treated together... more...

  • Shortest Connectivityby Dietmar Cieslik

    Springer US 2006; US$ 126.87

    The aim in this graduate level text is to outline the key mathematical concepts that underpin these important questions in applied mathematics. These concepts involve discrete mathematics (particularly graph theory), optimization, computer science, and several ideas in biology. more...

  • Chromatic Polynomials And Chromaticity Of Graphsby F M Dong; K M Koh; K L Teo

    World Scientific Publishing Company 2005; US$ 73.00 US$ 66.43

    This is the first book to comprehensively cover chromatic polynomials of graphs. It includes most of the known results and unsolved problems in the area of chromatic polynomials. Dividing the book into three main parts, the authors take readers from the rudiments of chromatic polynomials to more complex topics: the chromatic equivalence classes of... more...