Now showing items 1-2 of 2
A linear algorithm for the cutting center of a tree
(Elsevier, 1986-11-24)
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}. ...
A survey of the theory of hypercube graphs
(Elsevier, 1988)
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 ...