Search Results for ""

Given a 111×111 (0,1)-matrix, fill 11 spaces in each row in such a way that all columns also have 11 spaces filled. Furthermore, each pair of rows must have exactly one ...

A finite simple connected graph G is quadratically embeddable if its quadratic embedding constant QEC(G) is nonpositive, i.e., QEC(G)<=0. A graph being quadratically ...

The resistance distance between vertices i and j of a graph G is defined as the effective resistance between the two vertices (as when a battery is attached across them) when ...

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...

The Epstein zeta function for a n×n matrix S of a positive definite real quadratic form and rho a complex variable with R[rho]>n/2 (where R[z] denotes the real part) is ...

An integral graph, not to be confused with an integral embedding of a graph, is defined as a graph whose graph spectrum consists entirely of integers. The notion was first ...

The BCI triangle DeltaA^'B^'C^' of a triangle DeltaABC with incenter I is defined by letting A^' be the center of the incircle of DeltaBCI, and similarly defining B^' and ...

Various forms of opening and closing bracket-like delimiters are used for a number of distinct notational purposes in mathematics. The most common variants of bracket ...

One of the polynomials obtained by taking powers of the Brahmagupta matrix. They satisfy the recurrence relation x_(n+1) = xx_n+tyy_n (1) y_(n+1) = xy_n+yx_n. (2) A list of ...

The circum-medial triangle DeltaA^'B^'C^' is the circumcevian triangle of a reference triangle DeltaABC with respect to the triangle centroid G of DeltaABC (Kimberling 1998, ...