M. Livingston and Q. F. Stout, Perfect dominating sets, Congr. Numer. 79 (1990) 187--203. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Resource Placements in 2D Tori - Almohammad, Bose (1998) (Correct)
....error correcting codes and graph theory. Bae and Bose [3] and Bose et al. [7] have proposed solutions based on Lee distance error correcting codes [11, 5] On the other hand, Livingston and Stout have investigated resource placements using the concept of perfect dominating sets used in graph theory [12, 13]. The Lee distance is a metric used in the field of error correcting codes. It has been shown in [7] that the Lee distance is a natural metric to use with toroidal networks. Many topological properties of a toroidal network can be derived from this useful metric [7] Mixed Radix Notation: In a ....
M. Livingston and Q. Stout. "Perfect Dominating Sets". Conressus Numerantium, 79:187--203, 1990.
Resource Placement with Multiple Adjacency Constraints in.. - Ramanathan, Chalasani (1995) (1 citation) (Correct)
....networks such as hypercubes, 2 and 3 dimensional meshes and tori, trees, cube connected cycles, and de Bruijn graphs. In particular, they propose methods to construct resource placements in which each non resource node can reach exactly one resource node within a distance of d (d 1) from itself [5]. In contrast, in this paper, we consider placements in which each non resource node is adjacent to j (j 1) resource nodes in k n . The rest of this paper is organized as follows. In Section 2, we prove that perfect (quasiperfect) j adjacency placements are not possible in k n if n j 2n ....
M. Livingston and Q. Stout, "Perfect dominating sets," Congressus Numerantium, vol. 79, pp. 187--203, 1990.
Congressus Numerantium 118 (1996), pp. 49-71. - Unique Domination In Self-citation (Stout) (Correct)
No context found.
M. Livingston and Q. F. Stout. Perfect dominating sets. Congressus Numerantium, 79:187--203, 1990.
Constant Time Computation of Minimum Dominating Sets - Livingston, Stout (1994) Self-citation (Livingston Stout) (Correct)
....The approach we describe in this paper can be easily modified to determine minimum dominating sets for fl(G Theta P (n) when P (n) is a complete t ary tree of height n, for fixed t and all n. Our approach can be adapted to allow different types of domination as well, such as perfect [LS90], efficient [BBHS, BBS] and total domination [HL90] and still retain the Theta(1) time complexity. We will illustrate with an example of this in Section 3.2. A closely related concept to dominating sets is that of packing. Let k be a positive integer. A subset K V is called a k packing of the ....
M. Livingston and Q.F. Stout, "Perfect dominating sets", Congressus Numerantium 79 (1990) 187--203.
Perfect Dominating Sets on Cube-Connected Cycles - Van Wieren, Livingston, Stout (1993) Self-citation (Livingston Stout) (Correct)
No context found.
Marilynn Livingston and Quentin F. Stout. Perfect Dominating Sets. Proceedings of the Twenty-first Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, 1990). Congressus Numerantium, pages 187--203, 1990.
Unique Domination in Cross-Product Graphs - Masters, Stout, Van Wieren (1996) Self-citation (Stout) (Correct)
No context found.
M. Livingston and Q. F. Stout. Perfect dominating sets. Congressus Numerantium, 79:187--203, 1990.
Perfect Codes in Direct Products of Cycles - Klavzar, Spacapan, Zerovnik (2005) (Correct)
No context found.
M. Livingston and Q. F. Stout, Perfect dominating sets, Congr. Numer. 79 (1990) 187--203.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC