GroupsGraph.sea.hqx Groups and Graphs William Kocay Computer Science Department University of Manitoba CANADA, R3T 2N2 bkocay@cs.umanitoba.ca Create and examine groups, graphs, and digraphs. Once a graph is constructed, you may edit the graph, extract and examine subgraphs, induced subgraphs, subgraph complements, and subgraph onverses. You can create a random graph, find the automorphism group of a graph, find isomorphisms between graphs, symmetrize the graph under a given group, find subgraph cosets, find longest path/cycle of a graph, search for a Hamiltonian cycle, find max matching vertices, k-factor (subgraph of order k), minimum separating set, minimal homeomorph, planar dual, line graph, bipartite double, neighbor graph, strong components, complement, converse, paths between vertices. Regarding groups, you can add a new generator, find the stabilizer, construct a tree of block systems, show signs of permutations, find orbit constituent, find even permutations, find commutator subgroup, find normal closure, choose a subgroup, find subgroup cosets, find G mod K, find the kernel, and find conjugates. Finally, the planarity operations are pivot on face, planar layout, dual subgraph, face boundary, and face walk. The interface is very much in the spirit of the Macintosh and the program is easy to use. Extensive on-line help is included, and it can also be printed out to serve as a manual. The program was tested on a PowerMac with no difficulties running. The author warns to turn of the Modern Memory Manager of the PowerMac before starting this program. -------------------------------------------------------------- Location in Mathematics Archives: Anonymous FTP: /mac/discreteMath /mac/graphTheory /mac/modernAlgebra Gopher: (First select "Software" then "Macintosh software arranged by subjects") discreteMath / Groups and Graphs graphTheory / Groups and Graphs modernAlgebra / Groups and Graphs --------------------------------------------------------------