Search Results for ""

R. C. Read defined the anarboricity of a graph G as the maximum number of edge-disjoint nonacyclic (i.e., cyclic) subgraphs of G whose union is G (Harary and Palmer 1973, p. ...

A number of graphs are associated with P. J. Owens. The 76-node Owens graph (Owens 1980) provides the smallest known example of a polyhedral quintic nonhamiltonian graph. It ...

A Hamiltonian path, also called a Hamilton path, is a graph path between two vertices of a graph that visits each vertex exactly once. If a Hamiltonian path exists whose ...

The adjacency matrix, sometimes also called the connection matrix, of a simple labeled graph is a matrix with rows and columns labeled by graph vertices, with a 1 or 0 in ...

A minimum edge cut of a graph is an edge cut of smallest possible size. The size of a minimum edge cut in a connected graph G is called the graph's edge connectivity ...

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 ...

Two nonisomorphic graphs that have equal resistance spectra (i.e., multisets of resistance distances) are said to be resistance-equivalent. All nonisomorphic simple graphs on ...

A forest is an acyclic graph (i.e., a graph without any graph cycles). Forests therefore consist only of (possibly disconnected) trees, hence the name "forest." Examples of ...

The operator B^~ defined by B^~f(z)=int_D((1-|z|^2)^2)/(|1-zw^_|^4)f(w)dA(w) for z in D, where D is the unit open disk and w^_ is the complex conjugate (Hedenmalm et al. ...

The radial curve of a unit circle from a radial point (x,y) and parametric equations x = cost (1) y = sint (2) is another circle with parametric equations x_r = x-cost (3) ...