Search Results for ""

Multiple edges are two or more edges connecting the same two vertices within a multigraph. Multiple edges of degree d_(ij) between vertex i and vertex j correspond to an ...

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

An Ore graph is a graph that satisfies Ore's theorem, i.e., a graph G for which the sums of the degrees of nonadjacent vertices is greater than or equal to the number of ...

A connected graph is said to be highly irregular if the neighbors of each vertex have distinct vertex degrees. Highly irregular graphs exist on all orders except 3, 5 and 7, ...

An equation of the form P(x)=0, where P(x) is a polynomial.

The encrypted form of a plaintext.

A Ramsey number of the form R(k,k;2).

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

The difference between the sum of face angles A_i at a polyhedron vertex of a polyhedron and 2pi, delta=2pi-sum_(i)A_i.

A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.