메뉴 건너뛰기
Discrete Applied Mathematics
Volumn 94, Issue 1-3, 1999, Pages 101-139
Domination number of the cross product of paths
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0042709809     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00016-5     Document Type: Article
Times cited : (20)
References (11)
  • 1
    • 84987574179 scopus 로고
    • The domination numbers of the 5 × n and the 6 × n grid graphs
    • T.Y. Chang, W.E. Clark, The domination numbers of the 5 × n and the 6 × n grid graphs, J. Graph Theory 17 (1) (1993) 81-107.
    • (1993) J. Graph Theory , vol.17 , Issue.1 , pp. 81-107
    • Chang, T.Y.1    Clark, W.E.2
  • 2
    • 0042090927 scopus 로고
    • Domination numbers of complete grid graphs, I
    • T.Y. Chang, W.E, Clark, E.O. Hare, Domination numbers of complete grid graphs, I, Ars Combin. 38 (1994) 97-111.
    • (1994) Ars Combin. , vol.38 , pp. 97-111
    • Chang, T.Y.1    Clark, W.E.2    Hare, E.O.3
  • 4
    • 0006365812 scopus 로고
    • On the domination number of cross products of graphs
    • S. Gravier, A. Khelladi, On the domination number of cross products of graphs, Discrete Math. 145 (1995) 273-277.
    • (1995) Discrete Math. , vol.145 , pp. 273-277
    • Gravier, S.1    Khelladi, A.2
  • 5
    • 0042547388 scopus 로고
    • An application of beatable dominating sets to algorithms for complete grid graphs
    • Y. Alavi, A. Schwent (Eds.), Wiley, New York
    • E.O. Hare, D.C. Fisher, An application of beatable dominating sets to algorithms for complete grid graphs, in: Y. Alavi, A. Schwent (Eds.), Graph Theory, Combinatorics, and Applications, vol. 1, Wiley, New York, 1995, pp. 497-506.
    • (1995) Graph Theory, Combinatorics, and Applications , vol.1 , pp. 497-506
    • Hare, E.O.1    Fisher, D.C.2
  • 6
    • 0043048339 scopus 로고
    • Algorithms for computing the domination number of k×n complete grid graphs
    • E.O. Hare, S.T. Hedetniemi, W.R. Hare, Algorithms for computing the domination number of k×n complete grid graphs, Congr. Numer. 55 (1986) 81-92.
    • (1986) Congr. Numer. , vol.55 , pp. 81-92
    • Hare, E.O.1    Hedetniemi, S.T.2    Hare, W.R.3
  • 7
    • 0039907495 scopus 로고
    • On the domination number of products of graphs: I
    • M.S. Jacobson, L.F. Kinch, On the domination number of products of graphs: I, Ars Combin. 18 (1983) 33-44.
    • (1983) Ars Combin. , vol.18 , pp. 33-44
    • Jacobson, M.S.1    Kinch, L.F.2
  • 8
    • 0342800860 scopus 로고
    • The NP-completeness column: An ongoing guide
    • D.S. Johnson, The NP-completeness column: an ongoing guide, J. Algorithms 6 (1985) 434-451.
    • (1985) J. Algorithms , vol.6 , pp. 434-451
    • Johnson, D.S.1
  • 9
    • 0039315150 scopus 로고
    • Dominating cartesian products of cycles
    • S. Klavzar, N. Seifter, Dominating Cartesian products of cycles, Discrete Appl. Math. 59 (1995) 129-136.
    • (1995) Discrete Appl. Math. , vol.59 , pp. 129-136
    • Klavzar, S.1    Seifter, N.2
  • 10
    • 0009883801 scopus 로고    scopus 로고
    • Algebraic approach to fasciagraphs and rotagraphs
    • S. Klavzar, J. Zerovnik, Algebraic approach to fasciagraphs and rotagraphs, Discrete Appl. Math. 68 (1996) 93-100.
    • (1996) Discrete Appl. Math. , vol.68 , pp. 93-100
    • Klavzar, S.1    Zerovnik, J.2
  • 11
    • 0006368112 scopus 로고    scopus 로고
    • On a vizing-like conjecture for direct product graphs
    • S. Klavzar, B. Zmazek, On a Vizing-like conjecture for direct product graphs, Discrete Math. 156 (1996) 243-246.
    • (1996) Discrete Math. , vol.156 , pp. 243-246
    • Klavzar, S.1    Zmazek, B.2

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