Ivan Shishkin, Birch Grove

Concept

Graph

Combinatorics / Stub / edited by Ancient Tree

0 talk posts

A graph G:=(V,E)G:=(V,E) is defined by two sets VV and EV×VE\subset V\times V.
The elements of VV are called vertices while the elements of EE are called edges of the graph.

Examples
  • The graph G=({1,2,3,4,6},{(1,1),(2,3),(3,4),(4,2)})G=(\{1,2,3,4,6\}, \{(1,1), (2,3), (3,4), (4,2)\}) can be represented by an isolated vertex 11 linked to itself (called loop), a triangle made of vertices 2,3,42,3,4 and another isolated vertex called 66.
Problems using this concept (0)

No listed problems link to this concept yet.

Problems using this concept (spoiler) (0)

No listed problems use this concept as a spoiler yet.