MHB Nonisomorphic graphs with 10 vertices all of degree 3

  • Thread starter Thread starter Bingk1
  • Start date Start date
  • Tags Tags
    Degree 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.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top