   Chapter 10.3, Problem 15ES ### 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

# Draw all nonisomorphic simple graphs with four vertices.

To determine

Draw all nonisomorphic simple graphs with four vertices.

Explanation

Given information:

simple graphs with four vertices.

Calculation:

Two graphs are G and G’ (with vertices V ( G ) and V(G) respectively and edges E ( G ) and E(G) respectively) are isomorphic if there exists one-to-one correspondence such that

[u,v] is an edge in G[g(u),g(v)] is an edge of G.

We are interested in all nonisomorphic simple graphs with 4 vertices.

n = 4

We know that a simple graph with n vertices has most n(n1)2 edges and thus a simple graph with 4 vertices has at most 4(41)2=432=122=6 edges

### 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 