Search Results for ""

The neighborhood graph of a given graph from a vertex v is the subgraph induced by the neighborhood of a graph from vertex v, most commonly including v itself. Such graphs ...

A Lie algebra is nilpotent when its Lie algebra lower central series g_k vanishes for some k. Any nilpotent Lie algebra is also solvable. The basic example of a nilpotent Lie ...

A nilpotent Lie group is a Lie group G which is connected and whose Lie algebra is a nilpotent Lie algebra g. That is, its Lie algebra lower central series ...

A polyhedral graph having nine vertices. There are 2606 nonisomorphic nonahedral graphs, as first enumerated by Federico (1969; Duijvestijn and Federico 1981). Named ...

An odd number is an integer of the form n=2k+1, where k is an integer. The odd numbers are therefore ..., -3, -1, 1, 3, 5, 7, ... (OEIS A005408), which are also the gnomonic ...

An outerplanar graph is a graph that can be embedded in the plane such that all vertices lie on the outer face. Outerplanar graphs are planar and, by their definition, ...

The pair group of a group G is the group that acts on the 2-subsets of {1,...,p} whose permutations are induced by G. Pair groups can be calculated using PairGroup[g] in the ...

A simple unlabeled graph on n vertices is called pancyclic if it contains cycles of all lengths, 3, 4, ..., n. Since a pancyclic graph must contain a cycle of length n, ...

The golden ratio phi can be written in terms of a nested radical in the beautiful form phi=sqrt(1+sqrt(1+sqrt(1+sqrt(1+...)))), (1) which can be written recursively as ...

The n-path complement graph P^__n is the graph complement of the path graph P_n. The first few are illustrated above. Since P_4 is self-complementary, P^__4 is isomorphic to ...