Search Results for ""

Let S be a set of simple polygonal obstacles in the plane, then the nodes of the visibility graph of S are just the vertices of S, and there is an edge (called a visibility ...

The word "graph" has (at least) two meanings in mathematics. In elementary mathematics, "graph" refers to a function graph or "graph of a function," i.e., a plot. In a ...

A tree is planted at each lattice point in a circular orchard which has center at the origin and radius r. If the radius of trees exceeds 1/r units, one is unable to see out ...

A graph cycle.

The triangle graph is the cycle graph C_3, which is isomorphic to the complete graph K_3 as well as to the complete tripartite graph K_(3×1)=K_(1,1,1) and the triangular ...

An antimagic graph is a graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex differ.

The cube of a graph is defined as its third graph power.

A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...

The Reye graph is the transposition graph G_4 of order 4.

A reflexive graph is a pseudograph such that each vertex has an associated graph loop.