Suggest an editImprove this articleRefine the answer for “What is the size of a graph?”. Your changes go to moderation before they’re published.Approval requiredContentWhat you’re changing🇺🇸EN🇺🇦UAPreviewTitle (EN)Short answer (EN)The **size of a graph** is the **number of edges** in the graph. **Key point:** the size of a graph is the number of edges, that is, the number of connections between vertices.Shown above the full answer for quick recall.Answer (EN)ImageThe **size of a graph** is the **number of edges** in the graph. If a graph is denoted as **G = (V, E)**, then the **size of the graph = |E|**, where |E| is the number of edges in the set **E**. --- **Example:** If a graph has vertices **A, B, C** and edges **A-B**, **B-C**, **A-C**, then the size of the graph = **3**, because there are three connections. --- **Intuitively:** - **Order of a graph** → how many **vertices** (points). - **Size of a graph** → how many **edges** (connections) between them. --- **Summary:** the size of a graph is the number of edges, that is, the number of connections between vertices.For the reviewerNote to the moderator (optional)Visible only to the moderator. Helps review go faster.