Search Results for ""

For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...

The pentakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

A notion introduced by R. M. Wilson in 1974. Given a finite graph G with n vertices, puz(G) is defined as the graph whose nodes are the labelings of G leaving one node ...

The quadratic embedding constant QEC(G) of a finite simple connected graph G on n vertices is defined as the maximum of the product vDv over all real n-vectors v satisfying ...

Any square matrix T has a canonical form without any need to extend the field of its coefficients. For instance, if the entries of T are rational numbers, then so are the ...

A rational number is a number that can be expressed as a fraction p/q where p and q are integers and q!=0. A rational number p/q is said to have numerator p and denominator ...

The Cox configuration is a (2^(d-1))_d configuration whose Levi graph is the d-hypercube graph.

The quartic surface resembling a squashed round cushion on a barroom stool and given by the equation z^2x^2-z^4-2zx^2+2z^3+x^2-z^2 -(x^2-z)^2-y^4-2x^2y^2-y^2z^2+2y^2z+y^2=0.

For a finite group of h elements with an n_ith dimensional ith irreducible representation, sum_(i)n_i^2=h.

The function f(beta,z)|->z^((1+cosbeta+isinbeta)/2), illustrated above for beta=0.4.