Asymetric graph with three nods

  • Thread starter Thread starter Tom83B
  • Start date Start date
  • Tags Tags
    Graph
AI Thread Summary
The discussion centers on the asymmetry of a specific graph configuration with three nodes. It questions why the graph is not considered asymmetric, noting that there appears to be only one automorphism present. The conclusion reached is that the graph cannot be asymmetric due to the existence of non-trivial symmetries, specifically the permutation (1 2). This realization clarifies the initial confusion regarding the graph's properties. The conversation highlights the importance of understanding graph symmetries in determining asymmetry.
Tom83B
Messages
45
Reaction score
0
Why isn't this graph:
1-2 3
asymetric?
I think there exists only one automorphism:
2-1 3
but I'm also supposed to prove that ther are no asymetric graphs with 1<|V(G)|<=5
so it can't be assymetric
 
Mathematics news on Phys.org
Oh I see now! It can have no non-trivial symmetries and permutation (1 2) is already a non-trivial symmetry.
Sorry to bother
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Back
Top