Search Results for ""

A k-regular simple graph G on nu nodes is strongly k-regular if there exist positive integers k, lambda, and mu such that every vertex has k neighbors (i.e., the graph is a ...

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...

The uniform polyhedra are polyhedra consisting of regular (possibly polygrammic) faces of equal edge length whose polyhedron vertices are all symmetrically equivalent. The ...