Search Results for ""

The Hadwiger conjecture is a generalization of the four-color theorem which states that for any loopless graph G with h(G) the Hadwiger number and chi(G) the chromatic ...

The Laplacian spectral radius of a finite graph is defined as the largest value of its Laplacian spectrum, i.e., the largest eigenvalue of the Laplacian matrix (Lin et al. ...

The Randić index of a graph is defined as half the sum of the matrix elements of its Randić matrix. While the index was introduced to model the branching of the carbon-atom ...

A number of attractive 12-compounds of the regular tetrahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...

A tetraview is a visualization technique for bivariate complex functions. In the simplest case, the graph of a complex-valued function w=w(z) can be considered as a ...

The first and second Zagreb indices for a graph with vertex count n and vertex degrees v_i for i=1, ..., n are defined by Z_1=sum_(i=1)^nv_i^2 and Z_2=sum_((i,j) in ...

A two-dimensional affine geometry constructed over a finite field. For a field F of size n, the affine plane consists of the set of points which are ordered pairs of elements ...

An algebraic equation in n variables is an polynomial equation of the form f(x_1,x_2,...,x_n)=sum_(e_1,...,e_n)c_(e_1,e_2,...,e_n)x_1^(e_1)x_2^(e_2)...x_n^(e_n)=0, where the ...

Arc length is defined as the length along a curve, s=int_gamma|dl|, (1) where dl is a differential displacement vector along a curve gamma. For example, for a circle of ...

Informally, the term asymptotic means approaching a value or curve arbitrarily closely (i.e., as some sort of limit is taken). A line or curve A that is asymptotic to given ...