GraphTheory[IsTree]
|
Calling Sequence
|
|
IsTree(G)
|
|
Description
|
|
•
|
An undirected graph G on vertices is a tree if it is connected and has exactly edges.
|
•
|
The IsTree command returns true if the input graph is a tree, and false otherwise.
|
|
|
Examples
|
|
>
|
|
>
|
|
| (1) |
>
|
|
| (2) |
>
|
|
| (3) |
>
|
|
| (4) |
|
|
Download Help Document
Was this information helpful?