Answer:
is the number of graph edges which touch v
Step-by-step explanation:
To find the degree of a graph, figure out all of the vertex degrees. The degree of the graph will be its largest vertex degree. The degree of the network is 5.
Once you know the degree of the verticies we can tell if the graph is a traversable by lookin at odd and even vertecies. First lets look how you tell if a vertex is even or odd.
Hope this helps again! :)
Answer:
Rectangular Pyramid
Step-by-step explanation:
we know that
A <u><em>rectangular pyramid</em></u> is a three-dimensional figure that has a rectangular base and four lateral triangular faces
so
The total number of faces is 5 (one rectangular face plus four triangular faces)
The total number of vertices is 5 (four at the base and one at the apex)
The answer has to be 16 because when you add them it goes up
Answer:
9/8 or 1.125
Step-by-step explanation:
