Search Results for ""

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

In a graph G, two graph vertices are adjacent if they are joined by a graph edge.

A graph vertex in a graph is said to be an even node if its vertex degree is even.

As proposed by Hosoya (1971), the Hosoya index (also called Z-index) of a graph is defined by Z = sum_(k=0)^(n)|a_k| (1) = sum_(k=0)^(n)b_k, (2) where n is the number of ...

A self-avoiding polygon containing three corners of its minimal bounding rectangle. The anisotropic area and perimeter generating function G(x,y) and partial generating ...

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 number of outward directed graph edges from a given graph vertex in a directed graph.