Search Results for ""

A cross also called the tau cross or crux commissa, illustrated schematically above in polyomino form.

A clique covering of a graph G is set of cliques such that every vertex of G is a member of at least one clique. A minimum clique covering is a clique covering of minimum ...

Given a Schwarz triangle (p q r), replacing each polygon vertex with its antipodes gives the three colunar spherical triangles (p q^' r^'),(p^' q r^'),(p^' q^' r), (1) where ...

Let the opposite sides of a convex cyclic hexagon be a, a^', b, b^', c, and c^', and let the polygon diagonals e, f, and g be so chosen that a, a^', and e have no common ...

The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...

The mixtilinear triangle is the triangle connecting the centers of the mixtilinear incircles. It has trilinear vertex matrix (1) In has area (2) where Delta is the area of ...

A near-perfect matching is a matching in which a single vertex is left unmatched. Just as perfect matchings can occur only for graphs with an even number of vertices, ...

The lines joining the vertices of a tetrahedron to the centroids of the opposite faces are called medians. Commandino's theorem states that the four medians of a tetrahedron ...

The third Brocard triangle is Gibert's term for the isogonal conjugate of the first Brocard triangle. It has trilinear vertex matrix [b^2c^2 ab^3 ac^3; a^3b a^2c^2 bc^3; a^3c ...