• Title: Explorations in Algebraic Graph Theory with Sage
• Authors Chris Godsil and Rob Beezer
• Publisher: University of Puget Sound
• License(s): GNU Free Documentation License
• Paperback: N/A
• eBook: HTML and PDF
• Language: English
• ISBN-10: N/A
• ISBN-13: N/A
• Share This:  

Book Description

Algebraic Graph Theory is a beautiful subject and Sage is an ideal place to experiment with the relevant mathematics: graph theory, linear algebra and permutation groups, along with combinatorics generally. This book will provide a useful introduction for the student or researcher, while simultaneously aiding the continual improvement of Sage itself.

This book aims to express properties of graphs in algebraic terms, then to deduce theorems about them. It tackles the applications of linear algebra and matrix theory to the study of graphs; algebraic constructions such as adjacency matrix and the incidence matrix and their applications are discussed in depth.

Many algebraists associated a graph with a ring and study the interplay between the structure of the ring and the graph theoretic properties of the graph associated with it. In this book we studied the interplay between ring theoretic properties of a ring and the graph theoretic properties of its comaximal graph, comaximal ideal graph, unit graph and some other graphs related to its comaximal graph and comaximal ideal graph.

• N/A

• Amazon

• Graph Theory
• Algebra, Abstract Algebra (Groups, Rings, and Fields), and Linear Algebra, etc.
• Algorithms and Data Structures
• Computational and Algorithmic Mathematics
• Mathematical and Computational Software, MATLAB, etc.
• Geometry and Topology
• Discrete and Finite Mathematics

• Explorations in Algebraic Graph Theory with Sage (Chris Godsil, et al.)
• The Mirror Site (1) - HTML
• The Mirror Site (2) - PDF

• Spectral Geometry of Graphs (Pavel Kurasov)

  This open access book gives a systematic introduction into the Spectral Theory of differential operators on metric graphs. Main focus is on the fundamental relations between the spectrum and the geometry of the underlying graph.

• Graph Theory (Reinhard Diestel)

  This book covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail.

• Hypergraph Computation (Qionghai Dai, et al.)

  Comprehensive and systematic overview for Hypergraph computation. Rich blend of basic knowledge, theoretical analysis, algorithm introduction, and key applications. Describes hypergraph computation applications in computer vision, medical applications, etc.

• Planar Maps, Random Walks and Circle Packing (Asaf Nachmias)

  This open access book focuses on the interplay between random walks on planar maps and Koebe’s circle packing theorem. Entirely self-contained. Many classical proofs have been simplified and streamlined. Contains numerous useful exercises.

• Digraphs: Theory, Algorithms and Applications (J. Bang-Jensen)

  This book is an essential, comprehensive reference of Digraphs covering the theoretical aspects of the subject, focus on applications which include quantum mechanics, bioinformatics, embedded computing, and the travelling salesman problem.

• Graph Theory - Advanced Algorithms and Applications

  Not only will the methods and explanations help you to understand more about graph theory, but you will find it joyful to discover ways that you can apply graph theory in your applications or scientific research.

• Graph Theory and Complex Networks (Maarten van Steen)

  This book aims to explain the basics of graph theory that are needed at an introductory level for students in computer or information sciences. It also aims to provide an introduction to the modern field of network science.

• Probability on Trees and Networks (Russell Lyons, et al.)

  This book is concerned with certain aspects of discrete probability on infinite graphs that are currently in vigorous development. Of course, finite graphs are analyzed as well, but usually with the aim of understanding infinite graphs and networks.

• Random Graphs and Complex Networks (Remco van der Hofstad)

  This rigorous introduction to network science presents Random Graphs as models for real-world networks. Such networks have distinctive empirical properties and a wealth of new models have emerged to capture them.

• Algorithmic Graph Theory (David Joyner, et al)

  This is an introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source mathematics software. It's especially suitable for computer scientists and mathematicians interested in computational complexity.

• Graph Algorithms: Practical Examples in Apache Spark and Neo4j

  This book is a practical guide to getting started with graph algorithms for developers and data scientists who have experience using Apache Spark or Neo4j. You'll walk through hands-on examples that show you how to use graph algorithms in Apache Spark/Neo4j.