No.
No.
No.
No.
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other.
If between two adjacent vertices then in 2-dimensions it is a side, in 3-d and edge. If between non-adjacent vertices, a diagonal.
N-2 according to yahoo answers
I guess you mean "A line drawn between 2 vertices which are not next to each other?":The line is a diagonal.
Suppose a polygon has n vertices (and sides).From each vertex, a diagonal can be drawn to all vertices, excluding itself and the two adjacent vertices. So n-3 diagonals can be drawn from each vertex.Multiplying by the full complement of n vertices gives n(n-3). However, as things stand we have counted each diagonal twice: once at both ends. Dividing by two gives the actual number of diagonals.number of diagonals = n(n-3)/2
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other.
The line is called a diagonal if it is drawn between two nonadjacent angles.
If between two adjacent vertices then in 2-dimensions it is a side, in 3-d and edge. If between non-adjacent vertices, a diagonal.
120
Acv
10c5
A diagonal.
Square, triangle, circle, oval. Anything that can be drawn on a flat (planar) surface.
Parelle
A diagonal.
the answer is a parallelogram
A diagonal.