Search Results for ""

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. ...

The quadratic embedding constant QEC(G) of a finite simple connected graph G on n vertices is defined as the maximum of the product vDv over all real n-vectors v satisfying ...

For every proposition involving logical addition and multiplication ("or" and "and"), there is a corresponding proposition in which the words "addition" and "multiplication" ...

The digraph intersection of two digraphs is the digraph whose vertex set (respectively, edge set) is the intersection of their vertex sets (respectively, edge sets). If n is ...

A continuous real function L(x,y) defined on the tangent bundle T(M) of an n-dimensional smooth manifold M is said to be a Finsler metric if 1. L(x,y) is differentiable at ...

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 ...