Search Results for ""

The Laplacian polynomial is the characteristic polynomial of the Laplacian matrix. The second smallest root of the Laplacian polynomial of a graph g (counting multiple values ...

The pentatope graph is the skeleton of the pentatope, namely the complete graph K_5. It is sometimes also known as the Kuratowski graph (Nikolić et al. 2000, p. 281). Since ...

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

The second Zagreb index for a graph with vertex count n and vertex degrees d_i for i=1, ..., n is defined by Z_2=sum_((i,j) in E(G))d_id_j, where E(G) is the edge set of G.

A generalized quadrangle is a generalized polygon of order 4. An order-(s,t) generalized quadrangle contains s+1 points in each line and has t+1 lines through every point, ...

Three types of n×n matrices can be obtained by writing Pascal's triangle as a lower triangular matrix and truncating appropriately: a symmetric matrix S_n with (S)_(ij)=(i+j; ...

A generalization of the matrix to an n_1×n_2×... array of numbers.

A d-hyperoctant is one of the 2^d regions of space defined by the 2^d possible combinations of signs (+/-,+/-,...,+/-). The 2-hyperoctant is known as a quadrant and the ...

The dual of the rhombidodecadodecahedron U_(38) and Wenninger dual W_(76).

Let f and g be nonnegative and continuous functions on the closed interval [a,b], then the solid of revolution obtained by rotating the curves f(x) and g(x) about the x-axis ...