Optimal accessing and non-accessing structures for graph protocols

Details Optimal accessing and non-accessing structures for graph protocols Optimal accessing and non-accessing structures for graph protocols

2011-09-28

arxiv.org/abs/1109.6181v2

Computer Science

Computational Complexity

Scientific paper

An accessing set in a graph is a subset B of vertices such that there exists D subset of B, such that each vertex of V\B has an even number of neighbors in D. In this paper, we introduce new bounds on the minimal size kappa'(G) of an accessing set, and on the maximal size kappa(G) of a non-accessing set of a graph G. We show strong connections with perfect codes and give explicitly kappa(G) and kappa'(G) for several families of graphs. Finally, we show that the corresponding decision problems are NP-Complete.

Affiliated with

Also associated with

No associations

Rating

Optimal accessing and non-accessing structures for graph protocols does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal accessing and non-accessing structures for graph protocols, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal accessing and non-accessing structures for graph protocols will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-43571