메뉴 건너뛰기
Discrete Mathematics
Volumn 155, Issue 1-3, 1996, Pages 99-105
Nordhaus-Gaddum inequalities for domination in graphs
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0037555044     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(94)00373-Q     Document Type: Article
Times cited : (79)
References (16)
  • 2
    • 0024073028 scopus 로고
    • Vertex domination-critical graphs
    • R.C. Brigham, P.Z. Chinn and R.D. Dutton, Vertex domination-critical graphs, Networks 18 (1988) 173-179.
    • (1988) Networks , vol.18 , pp. 173-179
    • Brigham, R.C.1    Chinn, P.Z.2    Dutton, R.D.3
  • 4
    • 84986927578 scopus 로고
    • Toward a theory of domination in graphs
    • E.J. Cockayne and S.T. Hedetniemi, Toward a theory of domination in graphs, Networks 7 (1977) 247-261.
    • (1977) Networks , vol.7 , pp. 247-261
    • Cockayne, E.J.1    Hedetniemi, S.T.2
  • 5
    • 0003780715 scopus 로고
    • Addison-Wesley, Reading
    • F. Harary, Graph Theory (Addison-Wesley, Reading, 1969).
    • (1969) Graph Theory
    • Harary, F.1
  • 7
    • 0000652370 scopus 로고
    • Connected domination in graphs
    • B. Bollobás, ed. Academic Press, London
    • S.T. Hedetniemi and R. Laskar, Connected domination in graphs, in: B. Bollobás, ed. Graph Theory and Combinatorics, (Academic Press, London, 1984) 209-218.
    • (1984) Graph Theory and Combinatorics , pp. 209-218
    • Hedetniemi, S.T.1    Laskar, R.2
  • 8
    • 0000341838 scopus 로고
    • Bibliography on domination in graphs and some basic definitions of domination parameters
    • S.T. Hedetniemi and R. Laskar, Bibliography on domination in graphs and some basic definitions of domination parameters. Discrete Math. 86 (1990) 257-277.
    • (1990) Discrete Math. , vol.86 , pp. 257-277
    • Hedetniemi, S.T.1    Laskar, R.2
  • 9
    • 0000810522 scopus 로고
    • Relations du type nordhaus-gaddum pour le nombre d'absorption d'un graphe simple
    • F. Jaeger and C. Payan, Relations du type Nordhaus-Gaddum pour le nombre d'absorption d'un graphe simple, C.R. Acad. Sci. Paris A 274 (1972) 728-730.
    • (1972) C.R. Acad. Sci. Paris A , vol.274 , pp. 728-730
    • Jaeger, F.1    Payan, C.2
  • 11
    • 0011350906 scopus 로고
    • Vertex and edge domination parameters in graphs
    • R. Laskar and K. Peters, Vertex and edge domination parameters in graphs, Congr. Numer. 48 (1985) 291-305.
    • (1985) Congr. Numer. , vol.48 , pp. 291-305
    • Laskar, R.1    Peters, K.2
  • 12
    • 0010676310 scopus 로고
    • On domination related concepts in graph theory
    • Springer, Berlin
    • R. Laskar and H.B. Walikar, On domination related concepts in graph theory, Lecture Notes in Math, 885 (Springer, Berlin, 1981) 308-320.
    • (1981) Lecture Notes in Math , vol.885 , pp. 308-320
    • Laskar, R.1    Walikar, H.B.2
  • 14
    • 0000212806 scopus 로고
    • The connected domination number of a graph
    • E. Sampathkumar and H.B. Walikar, The connected domination number of a graph, J. Math. Phys. Sci. 13 (6) (1979) 607-613.
    • (1979) J. Math. Phys. Sci. , vol.13 , Issue.6 , pp. 607-613
    • Sampathkumar, E.1    Walikar, H.B.2
  • 15
    • 0042515258 scopus 로고
    • Edge dominating numbers of complementary graphs
    • Kalamazoo, MI, Wiley, New York
    • S. Schuster, Edge dominating numbers of complementary graphs, Graph Theory, Combinatorics, and Applications, Vol. 2 (Kalamazoo, MI, 1988) (Wiley, New York, 1991) 1053-1059.
    • (1988) Graph Theory, Combinatorics, and Applications , vol.2 , pp. 1053-1059
    • Schuster, S.1
  • 16
    • 0001270387 scopus 로고
    • Congruent graphs and the connectivity of graphs
    • H. Whitney, Congruent graphs and the connectivity of graphs, Amer. J. Math. 54 (1932) 150-168.
    • (1932) Amer. J. Math. , vol.54 , pp. 150-168
    • Whitney, H.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.