James K. Lan

Learn More
Multiple independent spanning trees (ISTs) have applications to fault-tolerant and data broadcasting in interconnections. Thus the designs of multiple ISTs in several classes of networks have been widely investigated. There are two versions of the n ISTs conjecture. The vertex (edge) conjecture is that any n-connected (n-edge-connected) graph has n(More)
For a fixed positive integer k, a k-tuple total dominating set of a graph G is a subset D ⊆ V (G) such that every vertex of G is adjacent to at least k vertices in D. The k-tuple total domination problem is to determine a minimum k-tuple total dominating set of G. This paper studies k-tuple total domination from an algorithmic point of view. In particular,(More)
For a positive integer k, a k-dominating set of a graph G is a subset D ⊆ V (G) such that every vertex not in D is adjacent to at least k vertex in D. The k-domination problem is to determine a minimum k-dominating set of G. This paper studies k-domination problem in graphs from an algorithmic point of view. In particular, we present a linear-time algorithm(More)