Graph embedding
= Graph embedding
{title2=$f:V(H)\hookrightarrow V(G)$}
A graph embedding in the subgraph sense is an <injective> <graph homomorphism>. It preserves edges, while it may send a nonedge to an edge. An induced embedding additionally preserves nonedges. For <directed graphs>, every prescribed arrow must be preserved.