Restrained domination in graphs

Discrete Mathematics

Volumn 203, Issue 1-3, 1999, Pages 61-69

  Domke, Gayla S ^a   Hattingh, Johannes H ^a   Hedetniemi, Stephen T ^b   Laskar, Renu C ^c   Markus, Lisa R ^d  

^a GEORGIA STATE UNIVERSITY   (United States)

^b Clemson University   (United States)

^c CLEMSON UNIVERSITY   (United States)

^d FURMAN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0005379428     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00016-3     Document Type: Article

References (7)

1. G. Chartrand, L. Lesniak, Graphs and Digraphs, Second ed., Wadsworth and Brooks/Cole, Monterey, CA, 1986.
2. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
3. F. Jaeger, C. Payan, Relations du type Nordhaus-Gaddum pour le nombre d'absorption d'un graphe simple, C. R. Acad. Sci. Ser. A 274 (1972) 728-730.
4. J.P. Joseph, S. Arumugam, A note on domination in graphs, Preprint.
5. E.A. Nordhaus, J.W. Gaddum, On complementary graphs, Amer. Math. Monthly 63 (1956) 175-177.
6. J.A. Telle, Vertex partitioning problems: characterization, complexity and algorithms on partial k-trees, Ph.D. Thesis, University of Oregon, CIS-TR-94-18.
7. T.V. Wimer, Linear algorithms on k-terminal graphs, Ph.D. Thesis, Clemson University, 1987.