A survey on graphs which have equal domination and closed neighborhood packing numbers

References

• R.B. Allan, G.S. Domke, S.T. Hedetniemi, and R.C. Laskar, Generalized packings and coverings of graphs, Congressus Numerantium 62 (1988), 259–270.
   Google Scholar
• D.W. Bange, A.E. Barkauskas, and P.J. Slater, Efficient dominating sets in graphs, in R.D. Ringeisen and F.S. Roberts (Eds.) Applications of Discrete Mathematics, pages 189–199, SIAM, Philadelphia, PA, 1988.
   Google Scholar
• C. Berge, Balanced matrices, Mathematical Programming 2 (1972)
   Google Scholar
• D.W. Bange, A.E. Barkauskas, L.H. Host, and P.J. Slater, Generalized domination and efficient domination in graphs, Discrete Mathematics 159 (1996), 1–11.
   Web of Science ®Google Scholar
• A.E. Brouwer, P. Duchet, and A. Schrijver, Graphs whose neighborhoods have no special cycles, Discrete Mathematics 47 (1983), 177–182.
   Web of Science ®Google Scholar
• G.S. Domke, S.T. Hedetniemi, and R.C. Laskar, Fractional packings, coverings and irredundance in graphs, Congressus Numerantium 66 (1988), 227–238.
   Google Scholar
• G.S. Domke, G. Fricke, R. Laskar, and A. Majumdar, Fractional Domination and Related Parameters, in T.W. Haynes, S.T. Hedetniemi, and P.J. Slater (Eds.), Domination in graphs: Advanced Topics, chapter 3, Marcel Dekker, Inc., New York, 1998.
   Google Scholar
• P.A. Dreyer, Jr., Applications and variations of domination in graphs, Ph.D. Thesis, Rutgers University, October 2000.
   Google Scholar
• M. Farber, Characterizations of strongly chordal graphs, Discrete Mathematics 43 (1983), 173–189.
   Web of Science ®Google Scholar
• D.R. Fulkerson, A.J. Hoffman, and R. Oppenheim, On balanced matrices, Mathematical Programming Study 1 (1974), 120–132.
   Google Scholar
• D. Gale, H.W. Kuhn, and A.W. Tucker, Linear programming and the theory of games, in Activity Analysis of Production and Allocation—proceedings of a conference, Wiley (1951), 317–329.
   Google Scholar
• A.P. Godbole and B. Wieland, On the domination number of a random graph, The Electronic Journal of Combinatorics 8 (2001) R37. http://www.combinatorics.org/Volume_8/PDF/v8ilr37.pdf
   Google Scholar
• D.L. Grinstead and P.J. Slater, Fractional domination and fractional packing in graphs, Congressus Numerantium 71 (1990), 153–172.
   Google Scholar
• B. Hartnell and D.F. Rall, Vizing's conjecture and the one-half argument, Discussiones Mathematicae 15 (1995), 205–216.
   Google Scholar
• T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998.
   Google Scholar
• T.W. Haynes, S.T. Hedetniemi, and P.J. Slater (Eds.), Domination in graphs: Advanced Topics, Marcel Dekker, Inc., New York, 1998.
   Google Scholar
• A.J. Hoffman, A.W. Kolen, and M. Sakarovitch, Totally balanced and greedy matrices, SIAM Journal of Algebraic Discrete Methods 6 (1985), 721–730.
   Google Scholar
• A.J. Hoffman, J.B. Kruskal, Integral boundary points of convex polyhedra. Linear inequalities and related systems, Annals of Mathematical Studies 38 (1956), 223–246.
   Google Scholar
• M.S. Jacobson and L.F. Kinch, On the domination of the products of graphs II Trees, Journal of Graph Theory 10 (1986), 97–106.
   Web of Science ®Google Scholar
• K. Iijima and Y. Shibata, A bipartite representation of a triangulated graph and its chordality, Gunma University, CS-79-1 (1979)
   Google Scholar
• T.A. McKee, Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs, Discrete Mathematics 260 (2003), 231–238.
   Web of Science ®Google Scholar
• A. Meir and J.W. Moon, Relations between packing and covering numbers of a tree, Pacific Journal of Mathematics 61 (1975), 225–233.
   Web of Science ®Google Scholar
• G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, NY, 1999.
   Google Scholar
• R.J. Nowakowski and D.F. Rall, Associative graph products and their independence, domination and coloring numbers, Discussiones Mathematicae 16 (1996), 53–79.
   Google Scholar
• M.J. Pelsmajer, J. Tokaz, and D.B. West, New proofs for strongly chordal graphs and chordal bipartite graphs, submitted.
   Google Scholar
• D.F. Rall, Total domination in categorical products of graphs, Discussiones Mathematicae 25 (2005), 35–44.
   Google Scholar
• R.C. Read and R.J. Wilson, An Atlas of Graphs, Oxford University Press, New York, 1998.
   Google Scholar
• D.J. Rose, Triangulated graphs and the elimination process, Journal of Mathematical Analysis and Applications 32 (1970), 597–609.
   Google Scholar
• E.R. Scheinerman and D.H. Ullman, Fractional Graph Theory, Wiley-Interscience, New York, 1997.
   Google Scholar
• P.J. Slater, LP-duality, complementarity, and generality of graphical subset parameters, in T.W. Haynes, S.T. Hedetniemi, and P.J. Slater (Eds.), Domination in graphs: Advanced Topics, chapter 1, Marcel Dekker, Inc., New York, 1998.
   Google Scholar
• V.G. Vizing, Some problems in graph theory, Uspekhi Matematicheskikh Nauk (Russian Math. Surveys) 23 (1968), 117–134.
   Google Scholar