How many graph isomorphic classes are there given n vertices?

  • Context: Graduate 
  • Thread starter Thread starter Dragonfall
  • Start date Start date
  • Tags Tags
    Classes Graph
Click For Summary

Discussion Overview

The discussion revolves around the number of graph isomorphic classes for undirected simple graphs with a given number of vertices. Participants are interested in the theoretical aspects and derivation of related formulas.

Discussion Character

  • Exploratory, Technical explanation, Debate/contested

Main Points Raised

  • One participant specifies that the discussion pertains to undirected simple graphs.
  • Another participant references a specific sequence related to the topic, suggesting it may provide relevant information.
  • A participant expresses interest in understanding the derivation of the formulas mentioned in the referenced link.
  • There is a suggestion of using brute force as a potential method for obtaining the formulas.
  • Some participants acknowledge the existence of a formula but seek clarification on how it is derived.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the methods for deriving the formulas, and multiple viewpoints regarding the approach to the problem are present.

Contextual Notes

Limitations include the lack of detailed derivations for the formulas and the dependence on the referenced sequence for further understanding.

Dragonfall
Messages
1,023
Reaction score
5
I'm talking about undirected simple graphs.
 
Mathematics news on Phys.org
I believe this is
http://www.research.att.com/~njas/sequences/A000088
 
Last edited by a moderator:
Thanks. I'd like to see how those formulas were obtained, though.
 
Brute force??
 
The formula is at the bottom of the link above.
 
Yes but how do you derive said formula?
 

Similar threads

Undergrad Classify the isomorphism of a graph
  • · Replies 3 ·
Replies
3
Views
2K
Undergrad The number of intersection graphs of ##n## convex sets in the plane
  • · Replies 2 ·
Replies
2
Views
1K
Undergrad Prove that a given graph contains a cycle using induction (Graph Theory)
  • · Replies 7 ·
Replies
7
Views
3K
Undergrad Edge connectivity of a graph given the number of edge disjoint paths
  • · Replies 1 ·
Replies
1
Views
2K
Undergrad Finding the dependence of maximum vertex degree on k-colorability
  • · Replies 1 ·
Replies
1
Views
2K
MHB How many girls were there in the class?
  • · Replies 2 ·
Replies
2
Views
1K
Undergrad Finding the chromatic number of a graph with biconnected components
  • · Replies 1 ·
Replies
1
Views
2K
Undergrad How to prove that 2 graphs are not isomorphic?
  • · Replies 4 ·
Replies
4
Views
11K
MHB Number of students in a class at first
  • · Replies 3 ·
Replies
3
Views
2K
Graduate Counting edge numbers in bipartite graphs
  • · Replies 1 ·
Replies
1
Views
2K