Search Results for ""

A node which is one graph edge further away from a given node in a rooted tree.

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

A hypergraph is a graph in which generalized edges (called hyperedges) may connect more than two nodes.

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

The concept of irredundance was introduced by Cockayne et al. (1978). Let N_G[v] denote the graph neighborhood of a vertex v in a graph G (including v itself), and let N_G[S] ...

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

Every nonplanar graph contains either the utility graph K_(3,3) (i.e., the complete bipartite graph on two sets of three vertices) or the pentatope graph K_5 as a ...

The Pasch configuration is the unbalanced (6_2,4_3) configuration (since there are two lines through each of six points and three points on each of four lines) illustrated ...

The radian is a unit of angular measure defined such that an angle of one radian subtended from the center of a unit circle produces an arc with arc length 1. A full angle is ...

The polyhedron compound of the small rhombicuboctahedron and its dual, the deltoidal icositetrahedron. The compound can be constructed from a small rhombicuboctahedron of ...