Search Results for ""

The small rhombicosidodecahedral graph is a quartic graph on 60 nodes and 120 edges that corresponds to the skeleton of the small rhombicosidodecahedron, as well as the great ...

The small rhombicuboctahedral graph is a quartic graph on 24 nodes and 48 edges that corresponds to the skeleton of the small rhombicuboctahedron. It has graph diameter 5, ...

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

A graphical partitioning based on the eigenvalues and eigenvectors of the Laplacian matrix of a graph.

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

An unordered pair representation is a representation of an undirected graph in which edges are specified as unordered pairs of vertex indices. The unordered pairs ...

The (m,q)-Ustimenko graph is the distance-1 or distance-2 graph of the dual polar graph on [C_m(q)] (Brouwer et al. 1989, p. 279). The Ustimenko graph with parameters m and q ...

A vertex-induced subgraph (sometimes simply called an "induced subgraph") is a subset of the vertices of a graph G together with any edges whose endpoints are both in this ...

A graph G is k-factorable if it is the union of disjoint k-factors (Skiena 1990, p. 244).

A generalization of the Euler L-function associated with a Grössencharakter.