Search Results for ""

The term "lobster" is used to refer either to a particular polyiamond or to a class of tree called a lobster graph. When referring to polyiamonds, the lobster is the ...

A set in Euclidean space R^d is convex set if it contains all the line segments connecting any pair of its points. If the set does not contain all the line segments, it is ...

The Lorenz asymmetry coefficient is a summary statistic of the Lorenz curve that measures the degree of asymmetry of a Lorenz curve. The Lorenz asymmetry coefficient is ...

The reciprocal curve of a given circle is the locus of a point which moves so that its distance from the center of reciprocation varies as its distance from the line which is ...

A periodic minimal surface constructed by Schwarz using the following two principles: 1. If part of the boundary of a minimal surface is a straight line, then the reflection ...

An unduloid, also called an onduloid, is a surface of revolution with constant nonzero mean curvature. It is a roulette obtained from the path described by the foci of a ...

The ABC (atom-bond connectivity) spectral radius rho_(ABC) of a graph is defined as the largest eigenvalue of its ABC matrix. Chen (2019) showed that for a tree on 3 or more ...

The Randić matrix A_(Randic) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=1/(sqrt(d_id_j)), (1) where d_i are the vertex degrees of the graph. In ...

There are (at least) two graphs associated with Horton, illustrated above. The first is a graph on 96 nodes providing a counterexample to the Tutte conjecture that every ...

A degree set is a set of integers that make up a degree sequence. Any set of positive integers is the degree set for some graph, because any odd integer from that set can be ...