Goto Chapter: Top 1 2 3 4 5 6 7 8 9 A Bib Ind
 [Top of Book]  [Contents]   [Next Chapter] 

Digraphs

Methods for digraphs

Version 0.10.1

Jan De Beule
Email: jdebeule@cage.ugent.be
Homepage: http://homepages.vub.ac.be/~jdbeule

Julius Jonušas
Email: jj252@st-andrews.ac.uk
Homepage: http://www-circa.mcs.st-andrews.ac.uk/~julius

James D. Mitchell
Email: jdm3@st-andrews.ac.uk
Homepage: http://goo.gl/ZtViV6

Michael Torpey
Email: mct25@st-andrews.ac.uk
Homepage: http://www-circa.mcs.st-andrews.ac.uk/~mct25

Wilf A. Wilson
Email: waw7@st-andrews.ac.uk
Homepage: http://www-circa.mcs.st-andrews.ac.uk/~waw7

Stuart Burrell

Luke Elliott

Christopher Jefferson

Markus Pfeiffer

Chris Russell

Finn Smith

Abstract

The Digraphs package is a GAP package containing methods for graphs, digraphs, and multidigraphs.

Copyright

© 2014-17 by Jan De Beule, Julius Jonušas, James D. Mitchell, Michael Torpey, Wilf A. Wilson et al.

Digraphs is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version.

Acknowledgements

We would like to thank Christopher Jefferson for his help in including the bliss tool in the package. This package's methods for computing digraph homomorphisms are based on work by Max Neunhöffer, and independently Artur Schäfer.

Contents

1 The Digraphs package
2 Installing Digraphs
3 Creating digraphs
4 Operators
5 Attributes and operations
6 Properties of digraphs
7 Homomorphisms
8 Finding cliques and independent sets
9 Visualising and IO
A Grape to Digraphs Command Map
References
Index

 [Top of Book]  [Contents]   [Next Chapter] 
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 A Bib Ind

generated by GAPDoc2HTML