Search Results for ""

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

A graph G is called d-polytopal if there exists a d-dimensional convex polytope P such that the vertices and edges of G are in a one-to-one incidence-preserving ...

A planar graph corresponding to polyhedra skeletons. The polyhedral graphs are special cases.

A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...

A graph G is transitive if any three vertices (x,y,z) such that edges (x,y),(y,z) in G imply (x,z) in G. Unlabeled transitive digraphs are called digraph topologies.

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

A weakly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...

In the figure above with tangent line PT and secant line PA, (PA)/(PT)=(PT)/(PB) (1) (Jurgensen et al. 1963, p. 346). The line tangent to a circle of radius a centered at ...

Four or more points P_1, P_2, P_3, P_4, ... which lie on a circle C are said to be concyclic. Three points are trivially concyclic since three noncollinear points determine a ...