Search Results for ""

The middle levels conjecture, also known as revolving door conjecture, posits that the middle layer graph has a Hamilton cycle for every n>=1. The conjecture was proved by ...

The Janko-Kharaghani graphs are two strongly regular graph on 936 and 1800 vertices. They have regular parameters (nu,k,lambda,mu)=(936,375,150,150) and (1800,1029,588,588), ...

A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

In general, a cross is a figure formed by two intersecting line segments. In linear algebra, a cross is defined as a set of n mutually perpendicular pairs of vectors of equal ...

The Burridge-Knopoff model is a system of differential equations used to model earthquakes using n points on a straight line, each of mass m, that interact with each other ...

A point related to the construction and properties of conic sections. Hyperbolas and noncircular ellipses have two distinct foci and two associated conic section directrices, ...

Functional analysis is a branch of mathematics concerned with infinite-dimensional vector spaces (mainly function spaces) and mappings between them. The spaces may be of ...

Radial line segments whose inward-pointing end produce the illusion of a circle or other figure. The apparent figure has the same color as the background, but appears ...

A partially ordered set P=(X,<=) is an interval order if it is isomorphic to some set of intervals on the real line ordered by left-to-right precedence. Formally, P is an ...

A maltitude ("midpoint altitude") is a perpendicular drawn to a side of a quadrilateral from the midpoint M_i of the opposite side. If the quadrilateral is cyclic, then the ...