Abstract
For a given tree T with n nodes, we say that a supergraph G tolerates T (having one faulty node) if for each node u of G the subgraph G-u contains T up to isomorphism. Then G tolerates T optimally if G has just one new node and no supergraph of T with n + 1 nodes having fewer edges than G tolerates T. The one-node fault tolerance edge cost of T is the number of new edges in G. We derive theorems which determine this cost exactly for two type of trees, namely, caterpillar and starlike trees.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have