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 ...

Regular tessellations of the plane by two or more convex regular polygons such that the same polygons in the same order surround each polygon vertex are called semiregular ...

The Sombor matrix A_(Sombor) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the graph. In ...

The surface of revolution obtained by cutting a conical "wedge" with vertex at the center of a sphere out of the sphere. It is therefore a cone plus a spherical cap, and is a ...

Consider a star graph S_(n+1) consisting of a central hub vertex and n spokes, but instead of placing a single point at the end of each spoke, place k points along it (in ...

The geometric centroid of the system obtained by placing a mass equal to the magnitude of the exterior angle at each vertex (Honsberger 1995, p. 120) is called the Steiner ...

The Steiner triangle DeltaS_AS_BS_C (a term coined here for the first time), is the Cevian triangle of the Steiner point S. It is the polar triangle of the Kiepert parabola. ...

The sequence of graphs starting with the Suzuki graph and successively taking local graphs, summarized in the following table, is known as the Suzuki tower, a name due to ...

The symmedial triangle DeltaK_AK_BK_C (a term coined here for the first time), is the triangle whose vertices are the intersection points of the symmedians with the reference ...

A transposition graph G_n is a graph whose nodes correspond to permutations and edges to permutations that differ by exactly one transposition (Skiena 1990, p. 9, Clark ...