Algebras, Graphs and their Applications


Book Description

This book introduces the study of algebra induced by combinatorial objects called directed graphs. These graphs are used as tools in the analysis of graph-theoretic problems and in the characterization and solution of analytic problems. The book presents recent research in operator algebra theory connected with discrete and combinatorial mathematical objects. It also covers tools and methods from a variety of mathematical areas, including algebra, operator theory, and combinatorics, and offers numerous applications of fractal theory, entropy theory, K-theory, and index theory.




Algebras, Graphs and their Applications


Book Description

This book introduces the study of algebra induced by combinatorial objects called directed graphs. These graphs are used as tools in the analysis of graph-theoretic problems and in the characterization and solution of analytic problems. The book presents recent research in operator algebra theory connected with discrete and combinatorial mathematic




Graph Algebra


Book Description

This book describes an easily applied language of mathematical modeling that uses boxes and arrows to develop very sophisticated, algebraic statements of social and political phenomena.




Graph Theory and Its Applications, Second Edition


Book Description

Already an international bestseller, with the release of this greatly enhanced second edition, Graph Theory and Its Applications is now an even better choice as a textbook for a variety of courses -- a textbook that will continue to serve your students as a reference for years to come. The superior explanations, broad coverage, and abundance of illustrations and exercises that positioned this as the premier graph theory text remain, but are now augmented by a broad range of improvements. Nearly 200 pages have been added for this edition, including nine new sections and hundreds of new exercises, mostly non-routine. What else is new? New chapters on measurement and analytic graph theory Supplementary exercises in each chapter - ideal for reinforcing, reviewing, and testing. Solutions and hints, often illustrated with figures, to selected exercises - nearly 50 pages worth Reorganization and extensive revisions in more than half of the existing chapters for smoother flow of the exposition Foreshadowing - the first three chapters now preview a number of concepts, mostly via the exercises, to pique the interest of reader Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.




Graphs and Matrices


Book Description

This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reorganized. Whilst this book will be invaluable to students and researchers in graph theory and combinatorial matrix theory, it will also benefit readers in the sciences and engineering.




Graph Algorithms in the Language of Linear Algebra


Book Description

The current exponential growth in graph data has forced a shift to parallel computing for executing graph algorithms. Implementing parallel graph algorithms and achieving good parallel performance have proven difficult. This book addresses these challenges by exploiting the well-known duality between a canonical representation of graphs as abstract collections of vertices and edges and a sparse adjacency matrix representation. This linear algebraic approach is widely accessible to scientists and engineers who may not be formally trained in computer science. The authors show how to leverage existing parallel matrix computation techniques and the large amount of software infrastructure that exists for these computations to implement efficient and scalable parallel graph algorithms. The benefits of this approach are reduced algorithmic complexity, ease of implementation, and improved performance.




Applications of Algebraic Topology


Book Description

This monograph is based, in part, upon lectures given in the Princeton School of Engineering and Applied Science. It presupposes mainly an elementary knowledge of linear algebra and of topology. In topology the limit is dimension two mainly in the latter chapters and questions of topological invariance are carefully avoided. From the technical viewpoint graphs is our only requirement. However, later, questions notably related to Kuratowski's classical theorem have demanded an easily provided treatment of 2-complexes and surfaces. January 1972 Solomon Lefschetz 4 INTRODUCTION The study of electrical networks rests upon preliminary theory of graphs. In the literature this theory has always been dealt with by special ad hoc methods. My purpose here is to show that actually this theory is nothing else than the first chapter of classical algebraic topology and may be very advantageously treated as such by the well known methods of that science. Part I of this volume covers the following ground: The first two chapters present, mainly in outline, the needed basic elements of linear algebra. In this part duality is dealt with somewhat more extensively. In Chapter III the merest elements of general topology are discussed. Graph theory proper is covered in Chapters IV and v, first structurally and then as algebra. Chapter VI discusses the applications to networks. In Chapters VII and VIII the elements of the theory of 2-dimensional complexes and surfaces are presented.




Topics in Algebraic Graph Theory


Book Description

There is no other book with such a wide scope of both areas of algebraic graph theory.




Operator Algebras and Their Applications


Book Description

The study of operator algebras, which grew out of von Neumann's work in the 1920s and the 1930s on modelling quantum mechanics, has in recent years experienced tremendous growth and vitality. This growth has resulted in significant applications in other areas - both within and outside mathematics. The field was a natural candidate for a 1994-1995 program year in Operator Algebras and Applications held at The Fields Institute for Research in the Mathematical Sciences. This volume contains a selection of papers that arose from the seminars and workshops of the program. Topics covered include the classification of amenable C*-algebras, the Baum-Connes conjecture, E[subscript 0] semigroups, subfactors, E-theory, quasicrystals, and the solution to a long-standing problem in operator theory: Can almost commuting self-adjoint matrices be approximated by commuting self-adjoint matrices?




Graphs on Surfaces and Their Applications


Book Description

Graphs drawn on two-dimensional surfaces have always attracted researchers by their beauty and by the variety of difficult questions to which they give rise. The theory of such embedded graphs, which long seemed rather isolated, has witnessed the appearance of entirely unexpected new applications in recent decades, ranging from Galois theory to quantum gravity models, and has become a kind of a focus of a vast field of research. The book provides an accessible introduction to this new domain, including such topics as coverings of Riemann surfaces, the Galois group action on embedded graphs (Grothendieck's theory of "dessins d'enfants"), the matrix integral method, moduli spaces of curves, the topology of meromorphic functions, and combinatorial aspects of Vassiliev's knot invariants and, in an appendix by Don Zagier, the use of finite group representation theory. The presentation is concrete throughout, with numerous figures, examples (including computer calculations) and exercises, and should appeal to both graduate students and researchers.