Search Results for ""

The geometric centroid of a polyhedron composed of N triangular faces with vertices (a_i,b_i,c_i) can be computed using the curl theorem as x^_ = ...

The volume of a polyhedron composed of N triangular faces with vertices (a_i,b_i,c_i) can be computed using the curl theorem as V=1/6sum_(i=1)^Na_i·n_i, where the normal n_i ...

An elementary theorem in geometry whose name means "asses' bridge," perhaps in reference to the fact that fools would be unable to pass this point in their geometric studies. ...

A RAT-free ("right angle triangle-free") set is a set of points, no three of which determine a right triangle. Let f(n) be the largest integer such that a RAT-free subset of ...

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

Let P and U be points, neither of which lies on a sideline of DeltaABC, given in barycentric coordinates by P=p:q:r and U=u:v:w. The P-reciprocal conjugate of U is then the ...

The Sombor energy of a graph is defined as the graph energy of its Sombor matrix, i.e., the sum of the absolute values of the eigenvalues of its Sombor matrix.

The Sombor index of a graph is defined as half the sum of the matrix elements of its Sombor matrix.

The Sombor matrix A_(Sombor) 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 graph. In ...

The Sombor spectral radius rho_(Sombor) of a graph is defined as the largest eigenvalue of the Sombor matrix. Liu et al. (2022) shows that for any tree, ...