Search Results for ""

The kite graph is the 5-vertex graph illustrated above (Brandstädt et al. 1987, p. 18). It is implemented in the Wolfram Language as GraphData["KiteGraph"]. Unfortunately, ...

Each Cartan matrix determines a unique semisimple complex Lie algebra via the Chevalley-Serre, sometimes called simply the "Serre relations." That is, if (A_(ij)) is a k×k ...

Let X be a set and S a collection of subsets of X. A subset A subset X is shattered by S if each subset B subset A of A can be expressed as the intersection of A with a ...

There are several differing definitions of the sun graph. ISGCI defines a (complete) n-sun graph as a graph on 2n nodes (sometimes also known as a trampoline graph; ...

The 12-vertex graph consisting of a cube in which two opposite faces (say, top and bottom) have edges drawn across them which connect the centers of opposite sides of the ...

The pentagonal hexecontahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal hexecontahedron. It is implemented in the Wolfram Language as ...

The pentagonal icositetrahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal icositetrahedron. It is implemented in the Wolfram Language as ...

The triakis tetrahedral graph is Archimedean dual graph which is the skeleton of the triakis tetrahedron. It is implemented in the Wolfram Language as ...

Define a Bouniakowsky polynomial as an irreducible polynomial f(x) with integer coefficients, degree >1, and GCD(f(1),f(2),...)=1. The Bouniakowsky conjecture states that ...

Given an expression involving known constants, integration in finite terms, computation of limits, etc., the constant problem is the determination of if the expression is ...