Ivan Shishkin, Birch Grove

Graph

Concept history

A revision trail for this concept page.

3 revisions

Back

Revision 521

7/20/2026, 8:01:45 PM · Ancient Tree

Concept edited

Compare with revision 4976 changed lines
1A graph $G:=(V,E)$ is defined by two [[Set|sets]] $V$ and $E\subset V\times V$.
2The elements of $V$ are called vertices while the elements of $E$ are called edges of the graph.
2
3##### Remarks and examples
4##### Examples
4- The elements of $V$ are called vertices while the elements of $E$ are called edges of the graph
5- The graph $G=(\{1,2,3,4,6\}, \{(1,1), (2,3), (3,4), (4,2)\})$ can be represented by an isolated vertex $1$ linked to itself (called loop), a triangle made of vertices $2,3,4$ and another isolated vertex called $6$.
5- For example, the graph $G=(\{1,2,3,4,6\}, \{(1,1), (2,3), (3,4), (4,2)\})$ can be represented by an isolated vertex $1$ linked to itself (called loop), a triangle made of vertices $2,3,4$ and another isolated vertex called $6$.

Revision 497

7/20/2026, 3:23:44 PM · Ancient Tree

Concept edited

Compare with revision 4858 changed lines
1A graph $G:=(V,E)$ is defined by two sets $V$ and $E\subset V\times V$.
1A graph $G:=(V,E)$ is defined by two [[Set|sets]] $V$ and $E\subset V\times V$.
2
3The elements of $V$ are called vertices while the elements of $E$ are called edges of the graph
4
5For exemple the graph $G=(\{1,2,3,4,6\}, \{(1,1), (2,3), (3,4), (4,2)\})$ can be represented by an isolated vertex $1$ linked to itself (called loop), a triangle made of vertices $2,3,4$ and another isolated vertex called $6$.
3##### Remarks and examples
4- The elements of $V$ are called vertices while the elements of $E$ are called edges of the graph
5- For example, the graph $G=(\{1,2,3,4,6\}, \{(1,1), (2,3), (3,4), (4,2)\})$ can be represented by an isolated vertex $1$ linked to itself (called loop), a triangle made of vertices $2,3,4$ and another isolated vertex called $6$.

Revision 485

7/20/2026, 7:10:55 AM · Sequoia

Concept created

A graph $G:=(V,E)$ is defined by two sets $V$ and $E\subset V\times V$.

The elements of $V$ are called vertices while the elements of $E$ are called edges of the graph

For exemple the graph $G=(\{1,2,3,4,6\}, \{(1,1), (2,3), (3,4), (4,2)\})$ can be represented by an isolated vertex $1$ linked to itself (called loop), a triangle made of vertices $2,3,4$ and another isolated vertex called $6$.