You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
\item\textbf{Induces subgraph}\Href{https://en.wikipedia.org/wiki/Induced_subgraph} of a graph $G = \Pair{V,E}$ is another graph $G'$ formed from a subset~$S$ of the vertices of the graph and \emph{all} the edges (from the original graph) connecting pairs of vertices in that subset.
Formally, $G' = G[S] = \Pair{V',E'}$, where $S \subseteq V$, $V' = V \intersection S$, $E' = \Set{e \in E \given\exists v \in S: e \mathrel{I} v}$.
Incidence relation
used inInduces subgraph
definition:discrete-math-course/cheat5.tex
Lines 215 to 216 in 042ae80
But it was firstly defined later:
discrete-math-course/cheat5.tex
Line 327 in 042ae80
The text was updated successfully, but these errors were encountered: