TreeQ[g] yields True if graph g is a tree.

TreeToCertificate[t] returns a binary string that is a certificate for the tree t such that trees have the same certificate if and only if they are isomorphic.

VertexCoverQ[g, c] yields True if the vertices in list c define a vertex cover of graph g.

V[g] gives the order or number of vertices of the graph g.

WeightingFunction is an option to the functions SetEdgeWeights and SetVertexWeights that tells the functions how to compute edge weights and vertex weights, respectively.

WeightRange is an option to the functions SetEdgeWeights and SetVertexWeights that gives the range for these weights.

WriteGraph[g, f] writes graph g to file f using an edge list representation.

Mathematica not only fits into standard accessibility frameworks, but also provides its own highly flexible interface accessibility options.

Long used in its simplest form in mathematics, functional iteration is an elegant way to represent repeated operations. Mathematica's symbolic architecture makes powerful ...

The Wolfram Demonstrations Project has provided an invaluable resource for educators, book authors, hobbyists, and professionals alike. Most Demonstrations are contributed by ...