# Differences

This shows you the differences between two versions of the page.

Both sides previous revision Previous revision Next revision | Previous revision | ||

2-regular_graph [2014/02/08 21:49] nikolaj |
2-regular_graph [2014/03/21 11:11] (current) |
||
---|---|---|---|

Line 1: | Line 1: | ||

===== 2-regular graph ===== | ===== 2-regular graph ===== | ||

==== Set ==== | ==== Set ==== | ||

- | | @#88DDEE: $V,E$ ... set | | + | | @#55CCEE: context | @#55CCEE: $V,E$ ... set | |

- | | @#FFBB00: $ \langle V,E,\psi\rangle \in \mathrm{it}(E,V) $ | | + | | @#FFBB00: definiendum | @#FFBB00: $ \langle V,E,\psi\rangle \in \mathrm{it}(E,V) $ | |

- | | @#AAFFAA: $ \langle V,E,\psi\rangle $ ... undirected graph | | + | | @#AAFFAA: inclusion | @#AAFFAA: $ \langle V,E,\psi\rangle $ ... undirected graph | |

- | | @#FFFDDD: $ v\in V $ | | + | | @#FFFDDD: for all | @#FFFDDD: $ v\in V $ | |

- | | @#55EE55: $ d(v)=2 $ | | + | | @#55EE55: postulate | @#55EE55: $ d(v)=2 $ | |

==== Discussion ==== | ==== Discussion ==== | ||

A finite 2-regular graph consists disconnected cycles. | A finite 2-regular graph consists disconnected cycles. | ||

- | A 2-regular graph consists disconnected cycles or infinite chains. | + | A general 2-regular graph consists disconnected cycles or infinite chains. |

==== Parents ==== | ==== Parents ==== | ||

=== Subset of === | === Subset of === |