Search Results for ""

A Lie group is called semisimple if its Lie algebra is semisimple. For example, the special linear group SL(n) and special orthogonal group SO(n) (over R or C) are ...

If a graph G has n graph vertices such that every pair of the n graph vertices which are not joined by a graph edge has a sum of valences which is >=n, then G is Hamiltonian. ...

Polysticks, sometimes also known as polyedges, are polyforms obtained from the edges of a regular grid. Square polysticks are polyforms obtained from the edges of a regular ...

The number of outward directed graph edges from a given graph vertex in a directed graph.

Dürer's solid, also known as the truncated triangular trapezohedron, is the 8-faced solid depicted in an engraving entitled Melencolia I by Albrecht Dürer (The British ...

The stability index Z^_(G) of a graph G is defined by Z^_=sum_(k=0)^(|_n/2_|)|c_(2k)|, where c_k is the kth coefficient of the characteristic polynomial and |_n_| denotes the ...

An undecahedron is a polyhedron having 11 faces. Examples include those illustrated above and summarized in the following table. F E V name 11 8 17 biaugmented triangular ...

The shortest path-spanning tree from a graph vertex of a graph.

As proposed by Hosoya (1971), the Hosoya index (also called Z-index) of a graph is defined by Z = sum_(k=0)^(n)|a_k| (1) = sum_(k=0)^(n)b_k, (2) where n is the number of ...

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...