Search Results for ""

The word adjoint has a number of related meanings. In linear algebra, it refers to the conjugate transpose and is most commonly denoted A^(H). The analogous concept applied ...

For a general two-player zero-sum game, max_(i<=m)min_(j<=n)a_(ij)<=min_(j<=n)max_(i<=m)a_(ij). If the two are equal, then write ...

The global clustering coefficient C of a graph G is the ratio of the number of closed trails of length 3 to the number of paths of length two in G. Let A be the adjacency ...

The circumference of a graph is the length of any longest cycle in a graph. Hamiltonian graphs on n>1 vertices therefore have circumference of n. For a cyclic graph, the ...

The mean distance of a (connected) graph is the mean of the elements of its graph distance matrix. Closed forms for some classes of named graphs are given in the following ...

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...

Given an n-dimensional vector x=[x_1; x_2; |; x_n], (1) a general vector norm |x|, sometimes written with a double bar as ||x||, is a nonnegative norm defined such that 1. ...

A partial differential equation of second-order, i.e., one of the form Au_(xx)+2Bu_(xy)+Cu_(yy)+Du_x+Eu_y+F=0, (1) is called hyperbolic if the matrix Z=[A B; B C] (2) ...

The triangle DeltaA^'B^'C^' formed by the points of pairwise intersection of the three intangents. It is not in perspective with DeltaABC. It has trilinear vertex matrix ...

The Leonine triangle DeltaX_AX_BX_C (a term coined here for the first time), is the Cevian triangle of Kimberling center X_(598). It is the polar triangle of the Lemoine ...