Determine the number of hamilton circuits in a complete graph with the following number of vertices.
14

Step-by-step explanation:

We have given the number of vertices = 14

We have to find the number of Hamilton circuit

Number of Hamilton circuit is given by (N-1)!, where N is the number of vertices

So the Hamilton circuit = ( 14-1 ) ! =13 ! = 13×12×11×10×9×8×7×6×5×4×3×2×1

So the number of Hamilton circuit

step-by-step explanation:

my butt

given that triangle abc is transformed two times to get triangle

a"b"c"

first abc is transformed in to a'b'c' as follows:

the coordinates of a are (1,-1) and transformed into a'(-1,1)

similarly b (4,-2) became b'(-4,2) and

c(7,-2) became c'(-7,2)

i.e. (x,y) becomes (-x,-y)

this is nothing but reflection about a point here origin.

thus first transformation is reflection on the origin.

next is exactly shifting 3 units down

source: