More results on greedy defining sets

Details More results on greedy defining sets More results on greedy defining sets

2008-11-04

arxiv.org/abs/0811.0454v1

Mathematics

Combinatorics

Scientific paper

The greedy defining sets of graphs were appeared first time in [M. Zaker, Greedy defining sets of graphs, Australas. J. Combin, 2001]. We show that to determine the greedy defining number of bipartite graphs is an NP-complete problem. This result answers affirmatively the problem mentioned in the previous paper. It is also shown that this number for forests can be determined in polynomial time. Then we present a method for obtaining greedy defining sets in Latin squares and using this method, show that any $n\times n$ Latin square has a GDS of size at most $n^2-(n\log n)/4$. Finally we present an application of greedy defining sets in designing practical secret sharing schemes.

Affiliated with

Also associated with

No associations

Rating

More results on greedy defining sets 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 More results on greedy defining sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and More results on greedy defining sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-183919