Editing Tree
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 2: | Line 2: | ||
==Characterization== | ==Characterization== | ||
− | For a simple graph, any two of these three statements, taken together, imply the third | + | For a simple graph, any two of these three statements, taken together, imply the third: |
* The graph is connected. | * The graph is connected. | ||
* The graph is acyclic. | * The graph is acyclic. |