# The Leading eBooks Store Online

## for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry...

Most popular at the top

#### Networks and Graphs

Elsevier Science 2003; US$ 89.95Dr Smith here presents essential mathematical and computational ideas of network optimisation for senior undergraduate and postgraduate students in mathematics, computer science and operational research. He shows how algorithms can be used for finding optimal paths and flows, identifying trees in networks, and optimal matching. Later chapters discuss... more...

#### Covering Walks in Graphs

Springer New York 2014; US$ 54.99Covering Walks in Graphs is aimed at researchers and graduate students in the graph theory community and provides a comprehensive treatment on measures of two well studied graphical properties, namely Hamiltonicity and traversability in graphs. This text looks into the famous K?nigsberg Bridge Problem, the Chinese Postman Problem, the Icosian Game... more...

#### Spanning Tree Results for Graphs and Multigraphs

World Scientific Publishing Company 2014; US$ 98.00This 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...

#### Systems Dependability Assessment

Wiley 2015; US$ 75.00Presents 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...

#### Graphical Enumeration

Elsevier Science 2014; US$ 72.95Graphical 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...

#### Matroid Decomposition

Elsevier Science 2014; US$ 72.95Matroid Decomposition deals with decomposition and composition of matroids. The emphasis is on binary matroids, which are produced by the matrices over the binary field GF(2). Different classes of matroids are described (graphic, regular, almost regular, max-flow min-cut), along with polynomial testing algorithms. Representative applications and, except... more...

#### Graph Theory and Computing

Elsevier Science 2014; US$ 72.95Graph 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...

#### Zero-Symmetric Graphs

Elsevier Science 2014; US$ 31.95Zero-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...

#### Least Action Principle Of Crystal Formation Of Dense Packing Type And Kepler's Conjecture

World Scientific Publishing Company 2001; US$ 163.00The 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 Applications

Springer 2001; US$ 128.00This text is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators. The book surveys the main approaches to obtaining good graph separations, while its main focus is on techniques for deriving lower bounds on the sizes of graph separators. more...