Source: wikibot/goldner-harary-graph
= Goldner–Harary graph
{wiki=Goldner–Harary_graph}
The Goldner–Harary graph is a specific type of graph in the field of graph theory. It is notable for being a particularly well-studied example of a cubic graph (a graph where every vertex has degree 3) that is also a spanning subgraph of the complete graph \\( K_6 \\). The Goldner–Harary graph has the following properties: 1. **Vertices and Edges**: It contains 7 vertices and 21 edges.