Search Results for ""

The Brocard circle, also known as the seven-point circle, is the circle having the line segment connecting the circumcenter O and symmedian point K of a triangle DeltaABC as ...

The real projective plane is the closed topological manifold, denoted RP^2, that is obtained by projecting the points of a plane E from a fixed point P (not on the plane), ...

The ABC (atom-bond connectivity) matrix A_(ABC) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt((d_i+d_j-2)/(d_id_j)), (1) where d_i are the ...

The arithmetic-geometric matrix A_(AG) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the ...

Consider a broadcast scheme on a connected graph from an originator vertex v in a graph G consisting of a sequence of parallel calls starting from v. In each time step, every ...

The first Zagreb index for a graph with vertex count n and vertex degrees d_i for i=1, ..., n is defined by Z_1=sum_(i=1)^nd_i^2. The notations Z_1 (e.g., Lin et al. 2023) ...

The maximum possible weight of a fractional clique of a graph G is called the fractional clique number of G, denoted omega^*(G) (Godsil and Royle 2001, pp. 136-137) or ...

Graph smoothing, also known as smoothing away or smoothing out, is the process of replacing edges e^'=v_iv_j and e^('')=v_jv_k incident at a vertex v_j of vertex degree 2 by ...

A paradox mentioned in the Greek work Mechanica, dubiously attributed to Aristotle. Consider the above diagram depicting a wheel consisting of two concentric circles of ...

The dual of Pascal's theorem (Casey 1888, p. 146). It states that, given a hexagon circumscribed on a conic section, the lines joining opposite polygon vertices (polygon ...