The Graph Editor

(Return to MM322 homepage)

(Return to MM322 software page)

The graph editor allows you to create graphs on the screen, add or delete vertices and edges, move vertices around, see the adjacency and incidence matrices, colour vertices and edges etc.

 

From the Windows Start menu, select Programs then Mathematics then MT356 Software and finally Graph Editor. This loads the Graph Editor—click on OK in the opening screen.

 

To create your own graph using the graph editor:

 

Once you have created your graph you can:

 

Exercise

Close the existing window, open a new window and create the following graph. Colour red all vertices of degree 2, colour green all vertices of degree 3, and colour blue all vertices of degree 4.

 

Now create, in the same window a different (that is, non isomorphic) graph with the same number of vertices of each degree as the graph above.

(Return to top)

 

The Graph Database             

(Return to MM322 homepage)

 

(Return to MM322 software page)

 

The Graph Database contains a database of all simple graphs with up to seven vertices—there are 1252 of them. With the graph editor still running, open the Graph Database (Start ® Programs ® Mathematics ® MT356 Software ® Graph Database).

 

The graphs in the database are listed as G1, G2 ..., G1252. For each graph, the database lists the number of vertices n, the number of edges m and the degree sequence. Clicking on a graph in the list opens a window containing a diagram of the graph.

 

For example, G100 is the following graph with 6 vertices and 6 edges.

 

 

It is possible to select (from those graphs currently listed in the main window) those graphs with a certain number of vertices or edges or having a certain degree sequence.

 

Examples

1. To select all (simple) graphs with 6 vertices and 6 edges:

button in the tool bar (or pull down the Select menu and choose No. Edges (m)) and enter 6 in the dialogue box that appears. This selects from the 156 currently listed all those graphs with 6 edges; there are 21 of them, listed as G86, ..., G106.

Now click on a few of these graphs to obtain a selection of the diagrams of various graphs with 6 vertices and 6 edges.

When you have finished, close the windows containing the graph diagrams.

 

2. To select all (simple) graphs with degree sequence (1, 2, 2, 3, 4, 4)

button in the tool bar (or pull down the Select menu and choose Degree sequence) and enter 1,2,2,3,4,4 in the dialogue box that appears. This selects all the graphs with degree sequence (1, 2, 2, 3, 4, 4); there are just 2 such graphs, G137 and G138.

Click on both of these graphs to obtain a diagram of each graph. Can you see why the two graphs are different (not isomorphic)?

 

Diagrams of graphs in the graph database cannot be manipulated directed. However, it is possible to copy a diagram from the database and paste it into the graph editor where it can be manipulated. For example, to paste a copy of G137 into the graph editor:

 

Note that you can also paste a copy of G138 into the same Graph Editor window if you wish. To do this repeat the steps above except do not select a new Graph Editor window—just paste G138 into the existing window.

Try now to manipulate the graphs so that you obtain the following picture to compare G137 and G138.

 

To see why the two graphs are different (not isomorphic), it may be useful to colour vertices of different degrees with different colours (for example, colour red all vertices of degree 2, colour green all vertices of degree 3, etc.)

 

Exercises

1. (i) How many graphs are there with 7 edges and 6 vertices?

Of these, exactly two are Eulerian. Which two?

(ii) How many graphs are there with degree sequence (1, 1, 2, 2, 2, 2)?

Of these, how many are trees?

 

2. Which graph in the database is the following?

 

(Return to MM322 homepage)

(Return to MM322 software page)