Search Results for ""

There are several sorts of graphs referred to as "star graphs" in mathematics, computer science, and information processing. The most common sort of star is the n-star graph ...

In general, an extremal graph is the largest graph of order n which does not contain a given graph G as a subgraph (Skiena 1990, p. 143). Turán studied extremal graphs that ...

"Vertex" is a synonym for a node of a graph, i.e., one of the points on which the graph is defined and which may be connected by graph edges. The terms "point," "junction," ...

Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

A graph or directed graph together with a function which assigns a positive real number to each edge (Harary 1994, p. 52).

A linklessly embeddable graph is a graph having the property that there exists an embedding in three dimensions that does not contain a nontrivial link. A graph is linklessly ...

A maximum clique of a graph G is a clique (i.e., complete subgraph) of maximum possible size for G. Note that some authors refer to maximum cliques simply as "cliques." The ...

A functional graph is a directed graph in which each vertex has outdegree one, and can therefore be specified by a function mapping {1,...,n} onto itself. Functional graphs ...

A graph in which individual nodes have no distinct identifications except through their interconnectivity. Graphs in which labels (which are most commonly numbers) are ...