Equivalence classes for a graph

Click For Summary
SUMMARY

The discussion focuses on determining the number of equivalence classes for graphs of order n and size k. Participants suggest that using the GAP (Groups, Algorithms, Programming) software is an effective approach to tackle this problem. The complexity of the task is acknowledged, indicating that a computational method is necessary for accurate results.

PREREQUISITES
  • Understanding of graph theory concepts, specifically equivalence classes.
  • Familiarity with the GAP software and its functionalities.
  • Knowledge of graph order and size definitions.
  • Basic programming skills to implement algorithms in GAP.
NEXT STEPS
  • Explore the capabilities of GAP for graph theory applications.
  • Research algorithms for calculating equivalence classes in graphs.
  • Study the concepts of graph order and size in detail.
  • Learn about other computational tools for graph analysis, such as SageMath.
USEFUL FOR

Mathematicians, computer scientists, and researchers in graph theory looking to analyze equivalence classes in graphs using computational methods.

JierenChen
Messages
11
Reaction score
0
Is there a way to figure out the number of equivalence classes for all graphs of order n, size k?
 
Mathematics news on Phys.org
It's not easy. Maybe the best way is with a program like GAP.
 

Similar threads

Undergrad The number of intersection graphs of ##n## convex sets in the plane
  • · Replies 2 ·
Replies
2
Views
1K
High School Correlation between shifting graph of a function and shifting the axes
  • · Replies 5 ·
Replies
5
Views
2K
Undergrad Classify the isomorphism of a graph
  • · Replies 3 ·
Replies
3
Views
2K
High School Graphing arccosine: What if we use different domains?
  • · Replies 7 ·
Replies
7
Views
2K
Undergrad Prove that a given graph contains a cycle using induction (Graph Theory)
  • · Replies 7 ·
Replies
7
Views
3K
Undergrad Finding the dependence of maximum vertex degree on k-colorability
  • · Replies 1 ·
Replies
1
Views
2K
Undergrad Finding if a subgraph of a minimal non-planar graph is maximal planar
  • · Replies 1 ·
Replies
1
Views
2K
Graduate Are these two optimization problems equivalent?
  • · Replies 1 ·
Replies
1
Views
2K
Undergrad Edge connectivity of a graph given the number of edge disjoint paths
  • · Replies 1 ·
Replies
1
Views
2K
MHB Can someone help me figure out what to mark off on this graph?
  • · Replies 15 ·
Replies
15
Views
2K