Search Results for ""

Let f_1(x), ..., f_n(x) be real integrable functions over the closed interval [a,b], then the determinant of their integrals satisfies

The graph complement of a graph hole. Graph antiholes are called even if they have an even number of vertices and odd if they have an odd number of vertices (Chvátal). No odd ...

An arc of a graph, sometimes also called a flag, is an ordered pair of adjacent vertices (Godsil and Royle 2001, p. 59), sometimes also called a directed line (Harary 1994, ...

The term in rigidity theory for the edges of a graph.

The co-rank of a graph G is defined as s(G)=m-n+c, where m is the number of edges of G, n is the number of vertices, and c is the number of connected components (Biggs 1993, ...

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

The graph difference of graphs G and H is the graph with adjacency matrix given by the difference of adjacency matrices of G and H. A graph difference is defined when the ...

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...

A 1-factor of a graph G with n graph vertices is a set of n/2 separate graph edges which collectively contain all n of the graph vertices of G among their endpoints.

A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both ...