GraphTheory
Maple package Graph Theory. The GraphTheory package is a collection of routines for creating graphs, drawing graphs, manipulating graphs, and testing graphs for properties. The graphs are sets of vertices (nodes) connected by edges. The package supports both directed and undirected graphs but not multigraphs. The edges in the graphs can be weighted or unweighted.
Keywords for this software
References in zbMATH (referenced in 6 articles , 2 standard articles )
Showing results 1 to 6 of 6.
Sorted by year (- Allem, L. Emilio; Jaume, Daniel A.; Molina, Gonzalo; Toledo, Maikon M.; Trevisan, Vilmar: Null decomposition of unicyclic graphs (2020)
- Almech, Alberto; Roanes-Lozano, Eugenio: Automatic generation of diagrammatic subway maps for any date with Maple (2020)
- Gerling, Melanie: Bivariate chromatic polynomials in computer algebra (2019)
- Shemyakova, Ekaterina: An algorithm for constructing Darboux transformations of type I for third-order hyperbolic operators of two variables (2016)
- Ebrahimi, Mohammad Ali; Ghebleh, Mohammad; Javadi, Mahdi; Monagan, Michael; Wittkopf, Allan: A graph theory package for Maple. II: Graph coloring, graph drawing, support tools, and networks (2006)
- Farr, Jeffrey B.; Khatirinejad, Mahdad; Khodadad, Sara; Monagan, Michael: A graph theory package for Maple (2005)