Definition:Spanning Subgraph
Jump to navigation
Jump to search
Definition
Let $G$ be a graph.
A spanning subgraph for $G$ is a subgraph of $G$ which contains every vertex of $G$.
Also known as
A spanning subgraph of a graph $G$ is also called a factor of $G$.
 | The validity of the material on this page is questionable. In particular: Should it not also be specified that $G$ should be connected, and so should such a subgraph? You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by resolving the issues. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Questionable}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |