MaxPower[temp, band] gives the radiative power emitted by a black body in the specified wavelength band band about the peak wavelength, at the specified temperature temp.

AllPairsShortestPath[g] gives a matrix, where the (i, j)\[Null]^th entry is the length of a shortest path in g between vertices i and j. AllPairsShortestPath[g, Parent] ...

CageGraph[k, r] gives a smallest k-regular graph of girth r for certain small values of k and r. CageGraph[r] gives CageGraph[3, r]. For k = 3, r can be 3, 4, 5, 6, 7, 8, or ...

CompleteGraph[n] creates a complete graph on n vertices. An option Type that takes on the values Directed or Undirected is allowed. The default setting for this option is ...

CompleteKPartiteGraph[a, b, c, ...] creates a complete k-partite graph of the prescribed shape, provided the k arguments a, b, c, ... are positive integers. An option Type ...

Dijkstra[g, v] gives a shortest-path spanning tree and associated distances from vertex v of graph g. The shortest-path spanning tree is given by a list in which element i is ...

GeneralizedPetersenGraph[n, k] returns the generalized Petersen graph, for integers n > 1 and k > 0, which is the graph with vertices {u_1, u_2, ..., u_n} and {v_1, v_2, ..., ...

GridGraph[n, m] constructs an n*m grid graph, the product of paths on n and m vertices. GridGraph[p, q, r] constructs a p*q*r grid graph, the product of GridGraph[p, q] and a ...

NecklacePolynomial[n, c, Cyclic] returns a polynomial in the colors in c whose coefficients represent numbers of ways of coloring an n-bead necklace with colors chosen from ...

RandomGraph[n, p] constructs a random labeled graph on n vertices with an edge probability of p.