   Chapter 10.3, Problem 27ES ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193

#### Solutions

Chapter
Section ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193
Textbook Problem
1 views

# Prove that each of the properties in 21-29 is an invariant for graph isomorphism. Assume that n, m, and k are all nonnegative integers.Is connected

To determine

To prove:

Prove that the property (is connected) is an invariant for graph isomorphism.

Explanation

Given information:

Assume that n, m and k are all nonnegative integers.

Proof:

Let G and G be isomorphic graphs and let the graph G be connected.

We then need to show that G is connected as well.

Let V ( G ) be the set of vertices of G and let V(G) be the set of vertices of G.

Let E(G) be the set of edges of G and let E ( G’ ) be the set of edges of G.

Since G and G are isomorphic, there exists two one-to-one correspondences

g:V(G)V(G') and h:E(G)E(G') such that v is an endpoint of eg(v) is an endpoint of h(e)

Let v and w be two distinct vertices in G'. Since g is a one-to-one correspondence,there exist distinct vertices a and b such that g(a)=v and g(b)=w.Since G is connected, there exists a walk ae1v1e2v2

### Still sussing out bartleby?

Check out a sample textbook solution.

See a sample solution

#### The Solution to Your Study Problems

Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!

Get Started 