Search Results for ""

The skewness of a graph G is the minimum number of edges whose removal results in a planar graph (Harary 1994, p. 124). The skewness is sometimes denoted mu(G) (Cimikowski ...

Graph smoothing, also known as smoothing away or smoothing out, is the process of replacing edges e^'=v_iv_j and e^('')=v_jv_k incident at a vertex v_j of vertex degree 2 by ...

The square of a graph is defined as its second graph power. The square of any biconnected graph is Hamiltonian (Fleischner 1974, Skiena 1990, p. 231). Mukhopadhyay (1967) has ...

An edge subdivision is the insertion of a new vertex v_j in the middle of an exiting edge e=v_iv_k accompanied by the joining of the original edge endpoints with the new ...

The graph sum of graphs G and H is the graph with adjacency matrix given by the sum of adjacency matrices of G and H. A graph sum is defined when the orders of G and H are ...

Suppose that G is a pseudograph, E is the edge set of G, and C is the family of edge sets of graph cycles of G. Then C obeys the axioms for the circuits of a matroid, and ...

A graphoid consists of a set M of elements together with two collections C and D of nonempty subsets of M, called circuits and cocircuits respectively, such that 1. For any C ...

The Grassmann graph J_q(n,k) is defined such that the vertices are the k-dimensional subspaces of an n-dimensional finite field of order q and edges correspond to pairs of ...

There are two different statements, each separately known as the greatest common divisor theorem. 1. Given positive integers m and n, it is possible to choose integers x and ...

Let S be a nonempty set of real numbers that has a lower bound. A number c is the called the greatest lower bound (or the infimum, denoted infS) for S iff it satisfies the ...