Search Results for ""

The number of graph edges meeting at a given node in a graph is called the order of that graph vertex.

Given a regular tetrahedron of unit volume, consider the lengths of line segments connecting pairs of points picked at random inside the tetrahedron. The distribution of ...

Also known as the Serret-Frenet formulas, these vector differential equations relate inherent properties of a parametrized curve. In matrix form, they can be written [T^.; ...

In a network with three graph edges at each graph vertex, the number of Hamiltonian cycles through a specified graph edge is 0 or even.

The Coxeter configuration is a 12_3 configuration whose Levi graph is the Nauru graph.

A 24-dimensional Euclidean lattice. An automorphism of the Leech lattice modulo a center of two leads to the Conway group Co_1. Stabilization of the one- and two-dimensional ...

The unit of information obtained by using the natural logarithm lnx instead of the base-2 logarithm log_2x=lgx when defining entropy and related information theoretic ...

A graph is a forbidden (vertex-)induced subgraph if its presence as a vertex-induced subgraph of a given graph means it is not a member of some family of graphs. For example, ...

Two graphs are homeomorphic if there is a graph isomorphism from some graph subdivision of one to some subdivision of the other.

Admitting an inverse. An object that is invertible is referred to as an invertible element in a monoid or a unit ring, or to a map, which admits an inverse map iff it is ...