Search Results for ""

The term "snark" was first popularized by Gardner (1976) as a class of minimal cubic graphs with edge chromatic number 4 and certain connectivity requirements. (By Vizing's ...

The Kirchhoff index Kf, also simply called the resistance and denoted R (Lukovits et al. 1999), of a connected graph G on n nodes is defined by ...

In combinatorial mathematics, the series-parallel networks problem asks for the number of networks that can be formed using a given number of edges. The edges can be ...

The number of inward directed graph edges from a given graph vertex in a directed graph.

If a graph G has n graph vertices such that every pair of the n graph vertices which are not joined by a graph edge has a sum of valences which is >=n, then G is Hamiltonian. ...

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

The number of outward directed graph edges from a given graph vertex in a directed graph.

A set in Euclidean space R^d is convex set if it contains all the line segments connecting any pair of its points. If the set does not contain all the line segments, it is ...

A uniform-density polyhedral solid is unistable (also called monostable) if it is stable on exactly one face (Croft et al. 1991, p. 61). For example, the 19-faced polyhedron ...

The shortest path-spanning tree from a graph vertex of a graph.