Search Results for ""

A tree decomposition is a mapping of a graph into a related tree with desirable properties that allow it to be used to efficiently compute certain properties (e.g., ...

The triakis truncated tetrahedron is a convex space-filling polyhedron which is the shape of the Voronoi cell of carbon atoms in diamond. It can be constructed from the ...

A triomino, also known as a tromino, is a 3-polyomino. There are two free polyominoes, (the same) two one-sided polyominoes, and 6 fixed polyominoes. The free polyominoes are ...

A tetrahedron having a trihedron all of the face angles of which are right angles. The face opposite the vertex of the right angles is called the base. If the edge lengths ...

A weak snark is a cyclically 4-edge connected cubic graph with edge chromatic number 4 and girth at least 4 (Brinkmann et al. 2013). Weak snarks therefore represent a more ...

A weighted adjacency matrix A_f of a simple graph is defined for a real positive symmetric function f(d_i,d_j) on the vertex degrees d_i of a graph as ...

The (m,n)-windmill graph is the graph obtained by taking m copies of the complete graph K_n with a vertex in common (Gallian 2011, p. 16). The (m,n)-windmill graph is ...

The Yff contact triangle DeltaX_AX_BX_C (a term coined here for the first time), is the Cevian triangle of Kimberling center X_(190). It is the polar triangle of the Yff ...

The Yiu A-circle of a reference triangle DeltaABC is the circle passing through vertex A and the reflections of vertices B and C with respect to the opposite sides. The Yiu ...

"The" octahedral graph is the 6-node 12-edge Platonic graph having the connectivity of the octahedron. It is isomorphic to the circulant graph Ci_6(1,2), the cocktail party ...