Search Results for ""

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

The diagonal triangle of a complete quadrangle is the triangle formed by its three diagonal points. If the quadrangle is a cyclic quadrilateral, then the circle is the polar ...

The dual of a regular tessellation is formed by taking the center of each polygon as a vertex and joining the centers of adjacent polygons. The triangular and hexagonal ...

Define A^' to be the point (other than the polygon vertex A) where the triangle median through A meets the circumcircle of ABC, and define B^' and C^' similarly. Then the ...

A path gamma is a continuous mapping gamma:[a,b]|->C^0, where gamma(a) is the initial point, gamma(b) is the final point, and C^0 denotes the space of continuous functions. ...

The resistance distance between vertices i and j of a graph G is defined as the effective resistance between the two vertices (as when a battery is attached across them) when ...

Suppose that G is a pseudograph, E is the edge set of G, and C is the family of edge sets of graph cycles of G. Then C obeys the axioms for the circuits of a matroid, and ...

If the Tutte polynomial T(x,y) of a graph G is given by sumt_(rs)x^ry^s, then the matrix (t_(rs)) is called the rank matrix of G. For example, the Tutte matrix of the ...

The set E of edges of a loopless graph (V,E), being a set of unordered pairs of elements of V, constitutes an adjacency relation on V. Formally, an adjacency relation is any ...

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...