|
\Large Name of class \quad\href{http://math.chapman.edu/cgi-bin/structures?action=edit;id=Template}{edit} % Note: replace "Template" with Name_of_class in previous line |
|
\Large Graphs \quad\href{http://math.chapman.edu/cgi-bin/structures?action=edit;id=Graphs}{edit} |
|
\abbreviation{Abbr} |
|
\abbreviation{Gph} |
|
A ... is a structure $\mathbf{A}=\langle A,...\rangle$ of type $\langle ...\rangle$ such that |
|
A graph is a structure $\mathbf{G}=\langle G, E\rangle$ such that |
|
$\langle A,...\rangle$ is a \href{Name_of_class.pdf}{name of class} |
|
$G$ is a set, |
|
$op_1$ is (name of property): $axiom_1$ |
|
$E$ is a binary relation on $G$: $E\subseteq G\times G$, and |
|
$op_2$ is ...: $...$ |
|
$E$ is symmetric: $xEy\implies yEx$ |
|
Let $\mathbf{A}$ and $\mathbf{B}$ be ... . A morphism from $\mathbf{A}$ to $\mathbf{B}$ is a function $h:A\rightarrow B$ that is a homomorphism: $h(x ... y)=h(x) ... h(y)$ |
|
Let $\mathbf{G}$ and $\mathbf{H}$ be graphs. A morphism from $\mathbf{G}$ to $\mathbf{H}$ is a function $h:G\rightarrow H$ that is a homomorphism: $xE^{\mathbf G}y\implies h(x)\,E^{\mathbf H}\,h(y)$. |