Search Results

As a measure of the extent to which the removal of a node disconnects a graph, the cutting number c(v) of a node v in a connected graph G has been defined to be the number of pairs of nodes in different components of G-{v}. ...

Consider the following two graphs M and N, both with vertex set Z x Z, where Z is the set of all integers. In M, two vertices are adjacent when their euclidean distance is 1, while in N, adjacency is obtained when the ...

We present a comprehensive survey of the theory of hypercube graphs. Basic properties related to distance, coloring, domination and genus are reviewed. The properties of the n-cube defined by its subgraphs are considered ...