Search Results for ""

A unigraphic graph (or simply a "unigraph") is a graph that is isomorphic to every graph having that degree sequence. All graphs on four are fewer vertices are unigraphic. ...

A generalization of the p-adic norm first proposed by Kürschák in 1913. A valuation |·| on a field K is a function from K to the real numbers R such that the following ...

The vertex connectivity kappa(G) of a graph G, also called "point connectivity" or simply "connectivity," is the minimum size of a vertex cut, i.e., a vertex subset S subset= ...

Let c_k be the number of vertex covers of a graph G of size k. Then the vertex cover polynomial Psi_G(x) is defined by Psi_G(x)=sum_(k=0)^(|G|)c_kx^k, (1) where |G| is the ...

The Weisfeiler-Leman dimension dim_(WL)(G) of a graph G, sometimes known as the WL dimension, is the smallest integer d such that the d-dimensional Weisfeiler-Leman algorithm ...

A zebra graph is a graph formed by all possible moves of a hypothetical chess piece called a "zebra" which moves analogously to a knight except that it is restricted to moves ...

De Grey (2018) found the first examples of unit-distance graphs with chromatic number 5, thus demonstrating that the solution to the Hadwiger-Nelson problem (i.e., the ...

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...

Every planar graph (i.e., graph with graph genus 0) has an embedding on a torus. In contrast, toroidal graphs are embeddable on the torus, but not in the plane, i.e., they ...

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...