Author: Jochen Pascal GollinPublisher:
ISBN:
Category :
Languages : en
Pages : 0
Book Description
Connectivity and Tree Structure in Infinite Graphs and Digraphs
Author: Jochen Pascal GollinEdge-connectivity and Tree-structure in Finite and Infinite Graphs
Author: Christian ElbrachtDigraphs
Author: Jorgen Bang-JensenPublisher: Springer Science & Business Media
ISBN: 1447138864
Category : Mathematics
Languages : en
Pages : 769
Book Description
The study of directed graphs (digraphs) has developed enormously over recent decades, yet the results are rather scattered across the journal literature. This is the first book to present a unified and comprehensive survey of the subject. In addition to covering the theoretical aspects, the authors discuss a large number of applications and their generalizations to topics such as the traveling salesman problem, project scheduling, genetics, network connectivity, and sparse matrices. Numerous exercises are included. For all graduate students, researchers and professionals interested in graph theory and its applications, this book will be essential reading.
Infinite Graphs with a Treelike Structure
Author: Matthias HamannThe Tree-like Connectivity Structure of Finite Graphs and Matroids
Author: Fabian HundertmarkIntroduction to Random Graphs
Author: Alan FriezePublisher: Cambridge University Press
ISBN: 1107118506
Category : Mathematics
Languages : en
Pages : 483
Book Description
The text covers random graphs from the basic to the advanced, including numerous exercises and recommendations for further reading.
Graph Theory with Applications to Engineering and Computer Science
Author: Narsingh DeoPublisher: PHI Learning Pvt. Ltd.
ISBN: 9788120301450
Category : Graph theory
Languages : en
Pages : 478
Book Description
Because of its inherent simplicity, graph theory has a wide range of applications in engineering, and in physical sciences. It has of course uses in social sciences, in linguistics and in numerous other areas. In fact, a graph can be used to represent almost any physical situation involving discrete objects and the relationship among them. Now with the solutions to engineering and other problems becoming so complex leading to larger graphs, it is virtually difficult to analyze without the use of computers. This book is recommended in IIT Kharagpur, West Bengal for B.Tech Computer Science, NIT Arunachal Pradesh, NIT Nagaland, NIT Agartala, NIT Silchar, Gauhati University, Dibrugarh University, North Eastern Regional Institute of Management, Assam Engineering College, West Bengal Univerity of Technology (WBUT) for B.Tech, M.Tech Computer Science, University of Burdwan, West Bengal for B.Tech. Computer Science, Jadavpur University, West Bengal for M.Sc. Computer Science, Kalyani College of Engineering, West Bengal for B.Tech. Computer Science. Key Features: This book provides a rigorous yet informal treatment of graph theory with an emphasis on computational aspects of graph theory and graph-theoretic algorithms. Numerous applications to actual engineering problems are incorpo-rated with software design and optimization topics.
Applying Graph Theory in Ecological Research
Author: Mark R.T. DalePublisher: Cambridge University Press
ISBN: 110708931X
Category : Mathematics
Languages : en
Pages : 355
Book Description
This book clearly describes the many applications of graph theory to ecological questions, providing instruction and encouragement to researchers.
The Mathematics of Chip-Firing
Author: Caroline J. KlivansPublisher: CRC Press
ISBN: 135180099X
Category : Computers
Languages : en
Pages : 296
Book Description
The Mathematics of Chip-firing is a solid introduction and overview of the growing field of chip-firing. It offers an appreciation for the richness and diversity of the subject. Chip-firing refers to a discrete dynamical system — a commodity is exchanged between sites of a network according to very simple local rules. Although governed by local rules, the long-term global behavior of the system reveals fascinating properties. The Fundamental properties of chip-firing are covered from a variety of perspectives. This gives the reader both a broad context of the field and concrete entry points from different backgrounds. Broken into two sections, the first examines the fundamentals of chip-firing, while the second half presents more general frameworks for chip-firing. Instructors and students will discover that this book provides a comprehensive background to approaching original sources. Features: Provides a broad introduction for researchers interested in the subject of chip-firing The text includes historical and current perspectives Exercises included at the end of each chapter About the Author: Caroline J. Klivans received a BA degree in mathematics from Cornell University and a PhD in applied mathematics from MIT. Currently, she is an Associate Professor in the Division of Applied Mathematics at Brown University. She is also an Associate Director of ICERM (Institute for Computational and Experimental Research in Mathematics). Before coming to Brown she held positions at MSRI, Cornell and the University of Chicago. Her research is in algebraic, geometric and topological combinatorics.
Rainbow Connections of Graphs
Author: Xueliang LiPublisher: Springer Science & Business Media
ISBN: 1461431190
Category : Mathematics
Languages : en
Pages : 108
Book Description
Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies in communication networks. Rainbow Connections of Graphs covers this new and emerging topic in graph theory and brings together a majority of the results that deal with the concept of rainbow connections, first introduced by Chartrand et al. in 2006. The authors begin with an introduction to rainbow connectedness, rainbow coloring, and rainbow connection number. The work is organized into the following categories, computation of the exact values of the rainbow connection numbers for some special graphs, algorithms and complexity analysis, upper bounds in terms of other graph parameters, rainbow connection for dense and sparse graphs, for some graph classes and graph products, rainbow k-connectivity and k-rainbow index, and, rainbow vertex-connection number. Rainbow Connections of Graphs appeals to researchers and graduate students in the field of graph theory. Conjectures, open problems and questions are given throughout the text with the hope for motivating young graph theorists and graduate students to do further study in this subject.