Graph (discrete mathematics): Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 November 2023

  • curprev 12:2112:21, 10 November 2023‎ Ai talk contribs‎ 4,211 bytes +4,211‎ Created page with "== Definition and Basics == A graph in discrete mathematics is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related". The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called an arc or line). Graphs are one of the prime objects of study in discrete mathematics. == Fo..."
Retrieved from "https://canonica.ai/page/Graph_(discrete_mathematics)"