# The Leading eBooks Store Online

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

#### 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...

#### The Fascinating World of Graph Theory

Princeton University Press 2015; US$ 29.95The fascinating world of graph theory goes back several centuries and revolves around the study of graphs?mathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most beautiful formulas in mathematics?and some of its most... more...

#### Quantitative Graph Theory

CRC Press 2014; US$ 124.95The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques,... 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...

#### Human Action Analysis with Randomized Trees

Springer Singapore 2014; US$ 54.99This book will provide a comprehensive overview on human action analysis with randomized trees. It will cover both the supervised random trees and the unsupervised random trees. When there are sufficient amount of labeled data available, supervised random trees provides a fast method for space-time interest point matching. When labeled data is minimal... more...

#### Codes from Difference Sets

World Scientific Publishing Company 2014; US$ 140.00This is the first monograph on codebooks and linear codes from difference sets and almost difference sets. It aims at providing a survey of constructions of difference sets and almost difference sets as well as an in-depth treatment of codebooks and linear codes from difference sets and almost difference sets. To be self-contained, this monograph covers... more...

#### Total Domination in Graphs

Springer New York 2014; US$ 109.00This book explores the fundamentals of total domination in graphs, the interplay with transversals in hypergraphs and the association with diameter-2-critical graphs. Includes several proofs, and a toolbox of proof techniques for attacking open problems. 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...

#### 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...