Search Results for ""

The rhombic triacontahedral graph is Archimedean dual graph which is the skeleton of the rhombic triacontahedron, great rhombic triacontahedron, and small triambic ...

Let a simple graph G have n vertices, chromatic polynomial P(x), and chromatic number chi. Then P(G) can be written as P(G)=sum_(i=0)^ha_i·(x)_(p-i), where h=n-chi and (x)_k ...

For a scalar function f over a surface parameterized by u and v, the surface integral is given by Phi = int_Sfda (1) = int_Sf(u,v)|T_uxT_v|dudv, (2) where T_u and T_v are ...

The taxicab metric, also called the Manhattan distance, is the metric of the Euclidean plane defined by g((x_1,y_1),(x_2,y_2))=|x_1-x_2|+|y_1-y_2|, for all points ...

A transposition graph G_n is a graph whose nodes correspond to permutations and edges to permutations that differ by exactly one transposition (Skiena 1990, p. 9, Clark ...

Let [arg(f(z))] denote the change in the complex argument of a function f(z) around a contour gamma. Also let N denote the number of roots of f(z) in gamma and P denote the ...

The n-wheel complement graph W^__n is the graph complement of the n-wheel graph. For n>4, W^__n is isomorphic to the graph disjoint union of a circulant graph ...

A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves ...

The circuit rank gamma, also denoted mu (Volkmann 1996, Babić et al. 2002) or beta (White 2001, p. 56) and known as the cycle rank (e.g., White 2001, p. 56), (first) graph ...

Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...