Template:Undirected graph property: Difference between revisions
(Created page with "{{quotation|This article defines a property that can be evaluated to true/false for any undirected graph, and is invariant under graph isomorphism.<br>[[:Category:Undi...") |
No edit summary |
||
| Line 1: | Line 1: | ||
{{quotation|This article defines a property that can be evaluated to true/false for any [[undirected graph]], and is invariant under [[graph isomorphism]].<br>[[:Category:Undirected graph properties|View other such properties]]}}<includeonly>[[Category:Undirected graph properties]]</includeonly> | {{quotation|This article defines a property that can be evaluated to true/false for any [[undirected graph]], and is invariant under [[graph isomorphism]]. Note that the term "undirected graph" as used here does not allow for loops or parallel edges, so there can be at most one edge between two distinct vertices, the edge is completely described by the vertices it joins, and there can be no edge from a vertex to itself.<br>[[:Category:Undirected graph properties|View other such properties]]}}<includeonly>[[Category:Undirected graph properties]]</includeonly> | ||
Latest revision as of 19:12, 27 May 2012
This article defines a property that can be evaluated to true/false for any undirected graph, and is invariant under graph isomorphism. Note that the term "undirected graph" as used here does not allow for loops or parallel edges, so there can be at most one edge between two distinct vertices, the edge is completely described by the vertices it joins, and there can be no edge from a vertex to itself.
View other such properties