next
|
previous
|
forward
|
backward
| up |
top
|
index
|
toc
|
Macaulay2 web site
Graphs
(missing documentation) ::
isTree
isTree -- determines whether a graph is a tree
Synopsis
Usage:
t = isTree G
Inputs:
G
,
an object of class
Graph
(missing documentation)
Outputs:
t
,
a
Boolean value
, whether a graph is a tree
Description
A graph is a tree if any two vertices are connected by a unique path of edges.
i1 : G = graph({{1,2},{1,3},{3,4},{3,5}},EntryMode=>"edges");
i2 : isTree G o2 = true
See also
isForest
-- determines whether a graph is a forest
isLeaf
-- determines whether a vertex is a leaf
leaves
-- lists the leaves of a tree graph
Ways to use
isTree
:
isTree(Graph)