Dominating sets of random 2-in 2-out directed graphs

Electronic Journal of Combinatorics

Volumn 15, Issue 1 R, 2008, Pages

  Howe, Stephen ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 39649086038     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/753     Document Type: Article

References (15)

1. M. Beis, W. Duckworth, and M. Zito. Packing vertices and edges in random regular graphs. Random Structures and Algorithms, 32(1):20-37, 2008.
2. M. Chlebík and J. Chlebíková. Approximation hardness of dominating set problems. In Proc. of 12th European Symposium on Algorithms (ESA 2004), volume 3221 of Lecture Notes in Computer Science, pages 192-203. Springer Verlag, 2004.
3. C. Cooper. A note on the connectivity of 2-regular digraphs. Random Structures Algorithms, 4(4):469-472, 1993.
4. J. Diaz, M.J. Serna, and N.C. Wormald. Computation of the bisection width for random d-regular graphs. Theoretical Computer Science, 382(2):120-130, 2007.
5. W. Duckworth and N. C. Wormald. Minimum independent dominating sets of random cubic graphs. Random Structures Algorithms, 21 (2): 147-161, 2002.
6. W. Duckworth and N.C. Wormald. On the independent domination number of random regular graphs. Combinatorics, Probability and Computing, 15(4):513-522, 2006.
7. A. Griewank. Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. Frontiers in Appl. Math. SIAM, Philadelphia, PA, 2000.
8. T.W. Haynes, S.T. Hedetniemi, and P.J. Slater. Domination In Graphs: Advanced Topics. Monographs and textbooks in pure and applied mathematics, 209. Marcel Dekker, Inc., New York, 1998.
9. S. Janson, T. Luczak, and A. Ruciński. Random Graphs. John Wiley and Sons, New York, 2000.
10. C. Lee. On the domination number of a digraph. PhD thesis, Department of Mathematics, Michigan State University, 1994.
11. B.D. McKay. Asymptotics for 0-1 matrices with prescribed line sums. In Enumeration and design (Waterloo, Ont., 1982), pages 225-238. Academic Press, Toronto, ON, 1984.
12. L. Shi and N.C. Wormald. Colouring random regular graphs. Combinatorics, Probability and Computing, 16(3):459-494, 2007.
13. N.C. Wormald. Differential equations for random processes and random graphs. The Annals of Applied Probability, 5(4):1217-1235, Nov. 1995.
14. N.C. Wormald. The differential equation method for random graph process and greedy algorithms. In M. Karoński and H. Prömel, editors, Lectures in Approximation and Randomized Algorithms, pages 73-155. PWN, Warsaw, 1999.
15. N.C. Wormald. Analysis of greedy algorithms on graphs with bounded degree. Discrete Mathematics, 273:235-260, 2003.