MHB Nonisomorphic graphs with 10 vertices all of degree 3

  • Thread starter Thread starter Bingk1
  • Start date Start date
  • Tags Tags
    Degree Graphs
Click For Summary
The discussion focuses on finding all non-isomorphic graphs with 10 vertices, each having a degree of three. A participant mentions that there are 19 such connected, 3-regular graphs, which were computed using the GENREG tool. Generalized Petersen graphs are suggested as a starting point, but they may not encompass all possibilities. The inquiry highlights the need for comprehensive resources or databases to explore these specific graph types. The conversation emphasizes the complexity of graph enumeration in this context.
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.
 

Thread 'A variant of the Monty Hall problem'

There is a nice little variation of the problem. The host says, after you have chosen the door, that you can change your guess, but to sweeten the deal, he says you can choose the two other doors, if you wish. This proposition is a no brainer, however before you are quick enough to accept it, the host opens one of the two doors and it is empty. In this version you really want to change your pick, but at the same time ask yourself is the host impartial and does that change anything. The host...
View full post »

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
Does G with all its degrees at least three contain a cycle with a chord?
  • · Replies 3 ·
Replies
3
Views
4K
I Question regarding degrees of a graph and its biconnected components
  • · Replies 34 ·
2
Replies
34
Views
4K
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