Search Results for ""

A graph Gamma is locally Petersen if, for each point t of Gamma, the graph induced by Gamma on all points adjacent to t (i.e., the neighborhood graph) is isomorphic to 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 index associated to a metric tensor g on a smooth manifold M is a nonnegative integer I for which index(gx)=I for all x in M. Here, the notation index(gx) denotes the ...

A magic square is said to be p-multimagic if the square formed by replacing each element by its kth power for k=1, 2, ..., p is also magic. A 2-multimagic square is called ...

The Napoleon-Feuerbach cubic is the pivotal isogonal cubic with nine-point center N as the pivot point. It therefore has trilinear equation ...

Beautiful patterns can be created by drawing sets of nested polygons such that the incircle of the nth polygon is the circumcircle of the (n+1)st and successive polygons are ...

A univariate function f(x) is said to be odd provided that f(-x)=-f(x). Geometrically, such functions are symmetric about the origin. Examples of odd functions include x, ...

Ono (1914) conjectured that the inequality 27(b^2+c^2-a^2)^2(a^2+c^2-b^2)^2(a^2+b^2-c^2)^2<=(4K)^6 holds true for all triangles, where a, b, and c are the lengths of the ...

Given a set X, a set function mu^*:2^X->[0,infty] is said to be an outer measure provided that mu^*(emptyset)=0 and that mu^* is countably monotone, where emptyset is the ...

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