Search Results for ""
2091 - 2100 of 2781 for Critical LineSearch Results
The Champernowne constant has decimal expansion C=0.1234567891011... (OEIS A033307). The Earls sequence (starting position of n copies of the digit n) for e is given for n=1, ...
An official chessboard is an 8×8 board containing squares alternating in color between olive green and buff (where "buff" is a color variously defined as a moderate orange ...
A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...
Let P(G) denote the chromatic polynomial of a finite simple graph G. Then G is said to be chromatically unique if P(G)=P(H) implies that G and H are isomorphic graphs, in ...
A portion of a disk whose upper boundary is a (circular) arc and whose lower boundary is a chord making a central angle theta<pi radians (180 degrees), illustrated above as ...
Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...
The complete bipartite graph K_(1,3) is a tree known as the "claw." It is isomorphic to the star graph S_4, and is sometimes known as the Y graph (Horton and Bouwer 1991; ...
The (upper) clique number of a graph G, denoted omega(G), is the number of vertices in a maximum clique of G. Equivalently, it is the size of a largest clique or maximal ...
A cograph (or "complement-reducible graph") is simple graph defined by the criteria 1. K_1 is a cograph, 2. If X is a cograph, then so is its graph complement, and 3. If X ...
The improvement of the convergence properties of a series, also called convergence acceleration or accelerated convergence, such that a series reaches its limit to within ...
...
View search results from all Wolfram sites (23876 matches)

