Search Results for ""

The word "order" is used in a number of different ways in mathematics. Most commonly, it refers to the number of elements in (e.g., conjugacy class order, graph order, group ...

The Krackhardt kite is the simple graph on 10 nodes and 18 edges illustrated above. It arises in social network theory. It is implemented in the Wolfram Language as ...

The digraph intersection of two digraphs is the digraph whose vertex set (respectively, edge set) is the intersection of their vertex sets (respectively, edge sets). If n is ...

The golden triangle, sometimes also called the sublime triangle, is an isosceles triangle such that the ratio of the hypotenuse a to base b is equal to the golden ratio, ...

The great dirhombicosidodecahedron is the uniform polyhedron with Maeder index 75 (Maeder 1997), Wenninger index 119 (Wenninger 1989), Coxeter index 82 (Coxeter et al. 1954), ...

There are at least two graphs associated with H. Walther. A graph on 25 vertices which appears somewhat similar to Tutte's fragment is implemented without discussion or ...

A pyramid is a polyhedron with one face (known as the "base") a polygon and all the other faces triangles meeting at a common polygon vertex (known as the "apex"). A right ...

Any triangle that has two equal angle bisectors (each measured from a polygon vertex to the opposite sides) is an isosceles triangle. This theorem is also called the ...

Flat polygons embedded in three-space can be transformed into a congruent planar polygon as follows. First, translate the starting vertex to (0, 0, 0) by subtracting it from ...

A pair of vertices (x,y) of a graph G is called an omega-critical pair if omega(G+xy)>omega(G), where G+xy denotes the graph obtained by adding the edge xy to G and omega(H) ...