Search Results for ""
2071 - 2080 of 4468 for Point Line DistanceSearch Results
A median A_1M_1 of a triangle DeltaA_1A_2A_3 is the Cevian from one of its vertices A_1 to the midpoint M_1 of the opposite side. The three medians of any triangle are ...
An integer whose decimal digits contain no zeros is said to be zerofree. The first few positive zerofree integers are 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, ...
The general bivariate quadratic curve can be written ax^2+2bxy+cy^2+2dx+2fy+g=0. (1) Define the following quantities: Delta = |a b d; b c f; d f g| (2) J = |a b; b c| (3) I = ...
The Hall-Janko graph, also known as the Hall-Janko-Wales graph, is a strongly regular graph on 100 nodes with parameters (nu,k,lambda,mu)=(100,36,14,12). It is also a ...
The Schläfli graph is a strongly regular graph on 27 nodes which is the graph complement of the generalized quadrangle GQ(2,4). It is the unique strongly regular graph with ...
The truncated Witt graph is the graph on 506 vertices related to a 4-(23,8,4) design (Brouwer et al. 1989, p. 367). It is called the M_(23) graph by van Dam and Haemers ...
Topology is the mathematical study of the properties that are preserved through deformations, twistings, and stretchings of objects. Tearing, however, is not allowed. A ...
A block is a maximal connected subgraph of a given graph G that has no articulation vertex (West 2000, p. 155). If a block has more than two vertices, then it is biconnected. ...
The detour matrix Delta, sometimes also called the maximum path matrix or maximal topological distances matrix, of a graph is a symmetric matrix whose (i,j)th entry is the ...
Flower graphs are a name given in this work to the generalization of the flower snarks J_n for positive n=5, 7, 9, ... to all integer n>=5. They are illustrated above for n=5 ...
...
View search results from all Wolfram sites (45668 matches)

