Search Results for ""

In Season 4 episode "Black Swan" of the television crime drama NUMB3RS, the character Amita Ramanujan refers to graph entropies when studying a map of the Los Angeles while ...

Let S be a set and F={S_1,...,S_p} a nonempty family of distinct nonempty subsets of S whose union is union _(i=1)^pS_i=S. The intersection graph of F is denoted Omega(F) and ...

There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...

The graph product denoted G-H and defined by the adjacency relations (gadjg^') or (g=g^' and hadjh^'). The graph lexicographic product is also known as the graph composition ...

The graph neighborhood of a vertex v in a graph is the set of all the vertices adjacent to v including v itself. More generally, the ith neighborhood of v is the set of all ...

An orientation of an undirected graph G is an assignment of exactly one direction to each of the edges of G. Only connected, bridgeless graphs can have a strong orientation ...

The kth power of a graph G is a graph with the same set of vertices as G and an edge between two vertices iff there is a path of length at most k between them (Skiena 1990, ...

The radius of a graph is the minimum graph eccentricity of any graph vertex in a graph. A disconnected graph therefore has infinite radius (West 2000, p. 71). Graph radius is ...

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