Search Results for ""

A cubic semisymmetric graph is a graph that is both cubic (i.e., regular of degree 3) and semisymmetric (i.e., edge- but not vertex-transitive). The four smallest cubic ...

The folded n-cube graph, perhaps better termed "folded hypercube graph," is a graph obtained by merging vertices of the n-hypercube graph Q_n that are antipodal, i.e., lie at ...

Seeks to obtain the best numerical estimate of an integral by picking optimal abscissas x_i at which to evaluate the function f(x). The fundamental theorem of Gaussian ...

The word "graph" has (at least) two meanings in mathematics. In elementary mathematics, "graph" refers to a function graph or "graph of a function," i.e., a plot. In a ...

Grinberg constructed a number of small cubic polyhedral graph that are counterexamples to Tait's Hamiltonian graph conjecture (i.e., that every 3-connected cubic graph is ...

The Harborth graph is the smallest known 4-regular matchstick graph. It is therefore both planar and unit-distance. It has 104 edges and 52 vertices. This graph was named ...

There are a number of algebraic equations known as the icosahedral equation, all of which derive from the projective geometry of the icosahedron. Consider an icosahedron ...

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...

The n-dimensional Keller graph, sometimes denoted G_n (e.g., Debroni et al. 2011), can be defined on a vertex set of 4^n elements (m_1,...,m_n) where each m_i is 0, 1, 2, or ...

The Kneser graphs are a class of graph introduced by Lovász (1978) to prove Kneser's conjecture. Given two positive integers n and k, the Kneser graph K(n,k), often denoted ...