9 edges, 6 vertices. A prism with an n-sided base will have 2n vertices, n + 2 faces, and 3n edges.
A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges. 4 faces, 6 edges, 4 vertices
n * (n - 1) / 2 That would ignore the "acyclic" part of the question. An acyclic graph with the maximum number of edges is a tree. The correct answer is n-1 edges.
A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges. 6 faces, 10 edges, 6 vertices
A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges. 16 edges, 9 vertices
A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges. 12 edges, 7 vertices, 12 edges
A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges. 6 edges, 4 vertices
A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges. 16 edges, 9 vertices
Ah, a heptagonal pyramid! Let's take a moment to appreciate its beauty. A heptagonal pyramid has 7 vertices and 10 edges. Each vertex is where two edges meet, creating a lovely connection between the faces of the pyramid.
A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges. 6 edges, 4 vertices
A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges. 8 edges, 5 vertices
A prism with an n-sided base will have 2n vertices, n + 2 faces, and 3n edges. 8 vertices, 12 edges
n-k-1
A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges. 8 edges, 5 vertices
A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges. 6 faces, 10 edges, 6 vertices
9 edges, 6 vertices. A prism with an n-sided base will have 2n vertices, n + 2 faces, and 3n edges.
A hexagonal pyramid has 7 faces, including the hexagonal base and 6 triangular faces. It has 12 edges, with 6 along the base and 6 connecting the base to the apex. Lastly, it has 7 vertices, with one at the apex, 6 along the base, and one where an edge meets the apex.