Differences between revisions 14 and 45 (spanning 31 versions)
 ⇤ ← Revision 14 as of 2007-06-12 23:53:06 → Size: 1585 Editor: D-69-91-136-41 Comment: ← Revision 45 as of 2008-11-14 13:41:54 → ⇥ Size: 2392 Editor: localhost Comment: converted to 1.6 markup Deletions are marked like this. Additions are marked like this. Line 3: Line 3: [:days4/projects/: Other SAGE Days 4 Project] [[days4/projects/| Other SAGE Days 4 Project]] Line 5: Line 5: Participants: Emily Kirkman, Robert Miller Participants: Emily Kirkman, Robert Miller, Craig Citro and David Roe{{{# Cayley Graph of \$A_5\$sage: G = sage.groups.perm_gps.permgroup.AlternatingGroup(5)sage: C = G.cayley_graph()sage: C.show3d(vertex_size=0.01, arc_size=0.005, arc_size2=0.008, xres=1000, yres=800)}}}== BEFORE =={{attachment:before.png}}== AFTER =={{attachment:after.png}}== NEW ==Vertex and edge colors for 3d graphs{{attachment:dod.png}}{{attachment:pet.png}} * (done) Latex Graphs: Craig Citro & Robert Miller -- write an eps file to be included in LaTeX documents. Line 7: Line 22: * NetworkX: The following modules could be useful, and have not yet been wrapped: centrality, cliques, cluster, cores, hybrid, search, spectrum, threshold   * centrality, cliques, cluster, cores, search -- These are pretty standard graph theoretic programs, and should not take too long to wrap.   * spectrum -- This should probably not be wrapped, but instead mimicked, since sage's linear algebra is undoubtedly faster.   * hybrid, threshold -- These seem to be specialized programs that are closely related to the research areas of the NetworkX authors. It is unclear what to do with these. * (done) NetworkX 1: Expose these in SAGE: centrality, cliques, cluster, cores, search.    * Also note significant updates to Generators class from wrapping NetworkX, (see the [[http://www.sagemath.org:9001/graph_generators|wiki]] for pretty pictures). Line 12: Line 25: * NICE: The nauty clone for computing automorphism groups of graphs, and computing isomorphism. It has been converted to Pyrex, but it could still stand much optimization. * [[http://sage.math.washington.edu/home/rlmill/wshlst.pdf|Wishlist]] from Chris Godsil. Most feasible first. Line 14: Line 27: * Wishlist from Chris Godsil: It would be great if we could complete the list this week. * (done) graph isomorphism and automorphism, graph6 and sparse6 formatting, database of small graphs, eigenvalues and eigenspaces, characteristic and minimal polynomials, cayley graphs, edge colorings Line 16: Line 29: * Electrical Networks, Jim Morrow's REU: Graphs with boundary are already in sage, but there are probably some useful constructions for Jim's summer REU that are not implemented yet. Especially data structures, perhaps an !ElectricalNetworks class. Look at the Dirichlet problem and (circular) planar embeddings of graphs. * (easy) bipartite graphs, point graph, line graph, graph from set and binary function, vertices as vector subspaces, generating trees Line 18: Line 31: * Latex Graphs: At sage days 3, Craig Citro gave Robert Miller a scheme program to plot graphs in postscript format. It would be great to get this working from python. * (medium) certain types of curves for plotting edges, generator based on geng    * (tedium) databases: ted spence, gordon royle    * (hard) max indep. set, chromatic number, hamilton cycles and paths, chromatic polynomial, tutte polynomial, cut vertices, vertex/edge connectivity, planarity Line 21: Line 38: * Emily Kirkman is currently working on this. * Electrical Networks, Jim Morrow's REU: Graphs with boundary are already in sage, but there are probably some useful constructions for Jim's summer REU that are not implemented yet. Especially data structures, perhaps an !ElectricalNetworks class. Look at the Dirichlet problem, graphs on surfaces and (circular) planar embeddings of graphs. * Bipartite Class * NetworkX 2:    * spectrum -- This should probably not be wrapped, but instead mimicked, since sage's linear algebra is undoubtedly faster.   * hybrid, threshold -- Figure out what these are?

# Graph Theory

Participants: Emily Kirkman, Robert Miller, Craig Citro and David Roe

```# Cayley Graph of \$A_5\$
sage: G = sage.groups.perm_gps.permgroup.AlternatingGroup(5)
sage: C = G.cayley_graph()
sage: C.show3d(vertex_size=0.01, arc_size=0.005, arc_size2=0.008, xres=1000, yres=800)```

## NEW

Vertex and edge colors for 3d graphs

• (done) Latex Graphs: Craig Citro & Robert Miller -- write an eps file to be included in LaTeX documents.

• (done) NetworkX 1: Expose these in SAGE: centrality, cliques, cluster, cores, search.
• Also note significant updates to Generators class from wrapping NetworkX, (see the wiki for pretty pictures).

• Wishlist from Chris Godsil. Most feasible first.

• (done) graph isomorphism and automorphism, graph6 and sparse6 formatting, database of small graphs, eigenvalues and eigenspaces, characteristic and minimal polynomials, cayley graphs, edge colorings
• (easy) bipartite graphs, point graph, line graph, graph from set and binary function, vertices as vector subspaces, generating trees
• (medium) certain types of curves for plotting edges, generator based on geng
• (tedium) databases: ted spence, gordon royle
• (hard) max indep. set, chromatic number, hamilton cycles and paths, chromatic polynomial, tutte polynomial, cut vertices, vertex/edge connectivity, planarity
• Graph Database: Update interface to sqlite database of all graphs with 8 or fewer vertices.
• Emily Kirkman is currently working on this.
• Electrical Networks, Jim Morrow's REU: Graphs with boundary are already in sage, but there are probably some useful constructions for Jim's summer REU that are not implemented yet. Especially data structures, perhaps an ElectricalNetworks class. Look at the Dirichlet problem, graphs on surfaces and (circular) planar embeddings of graphs.

• Bipartite Class
• NetworkX 2:
• spectrum -- This should probably not be wrapped, but instead mimicked, since sage's linear algebra is undoubtedly faster.
• hybrid, threshold -- Figure out what these are?

days4/projects/graphs (last edited 2008-11-14 13:41:54 by localhost)