Search Results for ""

The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...

A vertex is a special point of a mathematical object, and is usually a location where two or more lines or edges meet. Vertices are most commonly encountered in angles, ...

A curve with polar coordinates, r=b+asectheta (1) studied by the Greek mathematician Nicomedes in about 200 BC, also known as the cochloid. It is the locus of points a fixed ...

Combinatorics is the branch of mathematics studying the enumeration, combination, and permutation of sets of elements and the mathematical relations that characterize their ...

The Randić index of a graph is defined as half the sum of the matrix elements of its Randić matrix. While the index was introduced to model the branching of the carbon-atom ...

The first and second Zagreb indices for a graph with vertex count n and vertex degrees v_i for i=1, ..., n are defined by Z_1=sum_(i=1)^nv_i^2 and Z_2=sum_((i,j) in ...

The flower snarks, denoted J_n for n=5, 7, 9, ..., are a family of graphs discovered by Isaacs (1975) which are snarks. The construction for flower snarks may be generalized ...

The Q-chromatic polynomial, introduced by Birkhoff and Lewis (1946) and termed the "Q-chromial" by Bari (1974), is an alternate form of the chromatic polynomial pi(x) defined ...

The French metro metric is an example for disproving apparently intuitive but false properties of metric spaces. The metric consists of a distance function on the plane such ...

A complex vector bundle is a vector bundle pi:E->M whose fiber bundles pi^(-1)(m) are a copy of C^k. pi is a holomorphic vector bundle if it is a holomorphic map between ...