- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# Finding the simple non-isomorphic graphs with n vertices in a graph

## Problem Statement

How many simple non-isomorphic graphs are possible with 3 vertices?

## Solution

There are 4 non-isomorphic graphs possible with 3 vertices. They are shown below.

- Related Articles
- Program to find sum of the costs of all simple undirected graphs with n nodes in Python
- Finding the matching number of a graph
- Finding the number of spanning trees in a graph
- C++ Program to find out the super vertices in a graph
- Finding the line covering number of a graph
- Finding the number of regions in the graph
- Area of a polygon with given n ordered vertices in C++
- Edges and Vertices of Graph
- Maximum and minimum isolated vertices in a graph in C++
- Finding n subarrays with equal sum in JavaScript
- Isomorphic Strings in C++
- How do I display real-time graphs in a simple UI for a Python program?
- Finding the chromatic number of complete graph
- Construct a graph from given degrees of all vertices in C++
- Finding the first non-repeating character of a string in JavaScript

Advertisements