IncidenceGraph[m] gives the graph with incidence matrix m.
RegionPlot3D[pred, {x, x_min, x_max}, {y, y_min, y_max}, {z, z_min, z_max}] makes a plot showing the three-dimensional region in which pred is True.
RegionPlot[pred, {x, x_min, x_max}, {y, y_min, y_max}] makes a plot showing the region in which pred is True.
The general symbolic string patterns in Mathematica allow you to perform powerful string manipulation efficiently. What follows discusses the details of string patterns, ...
AlternatingPaths[g, start, ME] returns the alternating paths in graph g with respect to the matching ME, starting at the vertices in the list start. The paths are returned in ...
BipartiteMatchingAndCover[g] takes a bipartite graph g and returns a matching with maximum weight along with the dual vertex cover. If the graph is not weighted, it is ...
BipartiteMatching[g] gives the list of edges associated with a maximum matching in bipartite graph g. If the graph is edge weighted, then the function returns a matching with ...
Cofactor[m, {i, j}] calculates the (i, j)\[Null]^th cofactor of matrix m.
DegreesOf2Neighborhood[g, v] returns the sorted list of degrees of vertices of graph g within a distance of 2 from v.
Diameter[g] gives the diameter of graph g, the maximum length, among all pairs of vertices in g, of a shortest path between each pair.