Nonisomorphic graphs with 10 vertices all of degree 3

  • Context: MHB 
  • Thread starter Thread starter Bingk1
  • Start date Start date
  • Tags Tags
    Degree Graphs
Click For Summary
SUMMARY

The discussion centers on identifying all non-isomorphic, connected, 3-regular graphs with exactly ten vertices. It is established that there are 19 such graphs, which were computed using the GENREG tool. The user also mentions generalized Petersen graphs as a potential source, but it is confirmed that they do not encompass all possibilities.

PREREQUISITES
  • Understanding of graph theory concepts, specifically non-isomorphic graphs.
  • Familiarity with 3-regular graphs and their properties.
  • Knowledge of the GENREG tool for graph generation and analysis.
  • Basic understanding of Petersen graphs and their applications in graph theory.
NEXT STEPS
  • Research the GENREG tool for generating and analyzing non-isomorphic graphs.
  • Explore the properties and applications of 3-regular graphs in graph theory.
  • Investigate generalized Petersen graphs and their role in graph construction.
  • Study the classification of non-isomorphic graphs and methods for their enumeration.
USEFUL FOR

Graph theorists, mathematicians, and computer scientists interested in advanced graph structures and their properties, particularly those working with non-isomorphic and regular graphs.

Bingk1
Messages
16
Reaction score
0
Hello,
I need help finding all non-isomorphic graphs that have exactly ten vertices, and each vertex has degree three. Does anyone know where I could find them? Or how many there are?
I know that playing around with generalized Petersen graphs gives a few, but I doubt that would give all of them.

Thanks!
 
Physics news on Phys.org
Bingk said:
Hello,
I need help finding all non-isomorphic graphs that have exactly ten vertices, and each vertex has degree three. Does anyone know where I could find them? Or how many there are?
I know that playing around with generalized Petersen graphs gives a few, but I doubt that would give all of them.

Thanks!

Hi Bingk, :)

If you want all the non-isomorphic, connected, 3-regular graphs of 10 vertices please refer >>this<<. There seem to be 19 such graphs. The graphs were computed using GENREG.
 

Similar threads

MHB Minimum Degree of a Random Graph (Probabilistic Method)
  • · Replies 1 ·
Replies
1
Views
2K
MHB Is HSC NP-Complete in Graph Theory?
  • · Replies 1 ·
Replies
1
Views
2K
MHB Finding a Minimal Vertex Cover & Max Sets for a Graph
  • · Replies 2 ·
Replies
2
Views
2K
MHB Does the graph G with varying vertex degrees have an Eulerian path?
  • · Replies 3 ·
Replies
3
Views
2K
MHB What is the Name for a Graph with Loops That Join a Vertex to Nothing?
  • · Replies 4 ·
Replies
4
Views
3K
MHB Ans: Eulerian Circuits in K5 Graph: Does it Exist?
  • · Replies 13 ·
Replies
13
Views
5K
Graduate Does G with all its degrees at least three contain a cycle with a chord?
  • · Replies 3 ·
Replies
3
Views
4K
Undergrad Question regarding degrees of a graph and its biconnected components
  • · Replies 34 ·
2
Replies
34
Views
5K
MHB Graph Grammer Function For Two Exotic Graphs Question please.
  • · Replies 4 ·
Replies
4
Views
2K
MHB Some basic questions on Graph theory
  • · Replies 2 ·
Replies
2
Views
2K