Search Results for ""

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

A cograph (or "complement-reducible graph") is simple graph defined by the criteria 1. K_1 is a cograph, 2. If X is a cograph, then so is its graph complement, and 3. If X ...

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

A graph in which each graph edge is replaced by a directed graph edge, also called a digraph. A directed graph having no multiple edges or loops (corresponding to a binary ...

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

The deltoidal hexecontahedron is the 60-faced dual polyhedron of the small rhombicosidodecahedron A_5. It is sometimes also called the trapezoidal hexecontahedron (Holden ...

A quartic symmetric graph on 30 nodes and 60 edges corresponding to the skeleton of the Archimdean icosidodecahedron, great dodecahemidodecahedron, great icosidodecahedron, ...

A zonohedron which is the dual of the dodecadodecahedron U_(36) and Wenninger dual W_(73). The medial rhombic triacontahedron contains interior pentagrammic vertices which ...

A spheric section is the curve formed by the intersection of a plane with a sphere. Excluding the degenerate cases of the plane tangent to the sphere or the plane not ...

The ditrigonal icosidodecahedral graph is the skeleton of the cube 5-compound, ditrigonal dodecadodecahedron, great ditrigonalIcosidodecahedron, and small ditrigonal ...