Search Results for ""

A (Delta,D)-graph is a graph with maximum vertex degree Delta and diameter at most D. The order of a graph with degree Delta of diameter D is bounded by ...

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...

The size of a minimum edge cover in a graph G is known as the edge cover number of G, denoted rho(G). If a graph G has no isolated points, then nu(G)+rho(G)=|G|, where nu(G) ...

A polygonal diagonal is a line segment connecting two nonadjacent polygon vertices of a polygon. The number of ways a fixed convex n-gon can be divided into triangles by ...

The hypercube is a generalization of a 3-cube to n dimensions, also called an n-cube or measure polytope. It is a regular polytope with mutually perpendicular sides, and is ...

Given an original triangle (thick line), find the medial triangle (outer thin line) and its incircle. Take the pedal triangle (inner thin line) of the medial triangle with ...

A skew conic, also known as a gauche conic, space conic, twisted conic, or cubical conic section, is a third-order space curve having up to three points in common with a ...

A geometric implement discovered in a 19th century book, and whose inventor is unknown. It essentially consists of a semicircle, a segment SR which prolongs its diameter and ...

Barnette's conjecture asserts that every 3-connected bipartite cubic planar graph is Hamiltonian. The only graph on nine or fewer vertices satisfying Barnette's conditions is ...

Two nonisomorphic graphs that have equal resistance spectra (i.e., multisets of resistance distances) are said to be resistance-equivalent. All nonisomorphic simple graphs on ...