Search Results for ""

A surface parameterized in variables u and v is called smooth if the tangent vectors in the u and v directions satisfy T_uxT_v!=0, where AxB is a cross product.

A graph or directed graph together with a function which assigns a positive real number to each edge (Harary 1994, p. 52).

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

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 Hamiltonian number h(n) of a connected graph G is the length of a Hamiltonian walk G. In other words, it is the minimum length of a closed spanning walk in the graph. For ...

The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...

The sequence of graphs starting with the Suzuki graph and successively taking local graphs, summarized in the following table, is known as the Suzuki tower, a name due to ...

The Chern number is defined in terms of the Chern class of a manifold as follows. For any collection Chern classes such that their cup product has the same dimension as the ...

Consecutive numbers (or more properly, consecutive integers) are integers n_1 and n_2 such that n_2-n_1=1, i.e., n_2 follows immediately after n_1. Given two consecutive ...

The Pontryagin number is defined in terms of the Pontryagin class of a manifold as follows. For any collection of Pontryagin classes such that their cup product has the same ...