# Enumerate isomrphic subgraphs of graph vertex labeled

Enumerate all isomorphic subgraphs of given graph given the subgraph adjacency matrix

Enumerate isomrphic subgraphs of graph vertex labeled

Enumerate all isomorphic subgraphs of given graph given the subgraph adjacency matrix

0

All graphs in Sage support iteration over its major subcomponents, at least vertices and to create a graph from its adjacency matrix

mg= Graph(adj) mg.is_isomorphic(mg) -> True

```
# graph from adjency matrix
adj= Matrix ([ [0, 1, 1], [1, 0, 1], [1, 1, 0] ])
mg= Graph(adj)
mg.is_isomorphic(mg) -> True
```

If are you looking for the isomorphic subgraphs of the one you specify with the adj. graph you can usemg.subgraph_search_iterator().

too see how it might be used here. If you post the source as suggested above we could get a more detailed answer.

Here is a simple example of looking for the simplest graph, with zero vertices:

```
eg = Graph()
[p for p in mg.subgraph_search_iterator(eg)]
```

Asked: **
2010-09-14 19:17:45 -0600
**

Seen: **391 times**

Last updated: **Jun 02 '11**

How can I count the number of cycles of special length in a graph in sage?

Add graphs produced by a for loop?

Evaluating a symbolic expression for a Graph

show() does not show in the right place

How do I write function to test if a graph is apex?

How to get an arbitrary orientation of a graph.

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.

Can you post your code (up until the computation you want to perform)?