Search Results for ""

The height of a tree g is defined as the vertex height of its root vertex, where the vertex height of a vertex v in a tree g is the number of edges on the longest downward ...

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

A weighted adjacency matrix A_f of a simple graph is defined for a real positive symmetric function f(d_i,d_j) on the vertex degrees d_i of a graph as ...

Guy's conjecture, which has not yet been proven or disproven, states that the graph crossing number for a complete graph K_n is ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

The d-dimensional rigidity matrix M(G) of a graph G with vertex count n, edge count m in the variables v_i=(x_1,...,x_d) is the m×(dn) matrix with rows indexed by the edges ...

Dirac (1952) proved that if the minimum vertex degree delta(G)>=n/2 for a graph G on n>=3 nodes, then G contains a Hamiltonian cycle (Bollobás 1978, Komlós et al. 1996). In ...

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

A 24-dimensional Euclidean lattice. An automorphism of the Leech lattice modulo a center of two leads to the Conway group Co_1. Stabilization of the one- and two-dimensional ...