Search Results for ""

The triangle DeltaN_1N_2N_3 formed by joining a set of three Neuberg centers (i.e., centers of the Neuberg circles) obtained from the edges of a given triangle DeltaA_1A_2A_3 ...

The second Zagreb index for a graph with vertex count n and vertex degrees d_i for i=1, ..., n is defined by Z_2=sum_((i,j) in E(G))d_id_j, where E(G) is the edge set of G.

The second de Villiers point is the perspector of the reference triangle and the excenter analog of the BCI triangle, which is Kimberling center X_(1128) has triangle center ...

Let p run over all distinct primitive ordered periodic geodesics, and let tau(p) denote the positive length of p, then every even function h(rho) analytic in ...

A point process N is called self-correcting if cov(N(s,t),N(t,u))<0 for s<t<u where here, cov denotes the covariance of the two quantities. Intuitively, a process is ...

A self-isogonal cubic us a triangle cubic that is invariant under isogonal conjugation. The term is commonly applied to mean a pivotal isogonal cubic, in which points P lying ...

The chord through a focus parallel to the conic section directrix of a conic section is called the latus rectum, and half this length is called the semilatus rectum (Coxeter ...

A topological space X is semilocally simply connected (also called semilocally 1-connected) if every point x in X has a neighborhood U such that any loop L:[0,1]->U with ...

A septic graph is a regular graph of degree seven. The numbers of (not necessarily connected) simple septic graphs on n=8, 10, 12, ... vertices are 1, 5, 1547, 21609301, ...

A connected graph having e graph edges is said to be sequential if it is possible to label the nodes i with distinct integers f_i in {0,1,2,...,e-1} such that when graph edge ...