Isomorphism

# Isomorphism - CS208(4.1 – 42a Is the following pair of...

This preview shows pages 1–3. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS208 (4.1 – 42a) Is the following pair of graphs isomorphic? Justify answer. Answer: For the star: Looking at vertex , we see that it has connections to vertices , and since no single vertex can serve as both endpoints of an edge, cannot connect to itself, therefore the adjacency list for is V 1 V 2 V 3 V 4 V 5 Looking at vertex , we see that it has connections to vertices , and since no single vertex can serve as both endpoints of an edge, cannot connect to itself, therefore the adjacency list for is Looking at vertex , we see that it has connections to vertices , and since no single vertex can serve as both endpoints of an edge, cannot connect to itself, therefore the adjacency list for is Looking at vertex , we see that it has connections to vertices , and since no single vertex can serve as both endpoints of an edge, cannot connect to itself, therefore the adjacency list for...
View Full Document

{[ snackBarMessage ]}

### Page1 / 4

Isomorphism - CS208(4.1 – 42a Is the following pair of...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online