메뉴 건너뛰기




Volumn 113, Issue 2-3, 2001, Pages 303-306

Smallest independent dominating sets in Kronecker products of cycles

Author keywords

Codes; Cycle; Kronecker product; Perfect dominating sets; Smallest independent dominating sets

Indexed keywords


EID: 0035887929     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00295-X     Document Type: Article
Times cited : (12)

References (14)
  • 2
    • 0021483662 scopus 로고
    • Clustering and domination in perfect graphs
    • Corneil D.G., Perl Y. Clustering and domination in perfect graphs. Discrete Appl. Math. 9:1984;27-39.
    • (1984) Discrete Appl. Math. , vol.9 , pp. 27-39
    • Corneil, D.G.1    Perl, Y.2
  • 3
    • 0006365812 scopus 로고
    • On the domination number of cross products of graphs
    • Gravier S., Khelladi A. 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
  • 4
    • 0006338854 scopus 로고    scopus 로고
    • On domination numbers of Cartesian products of paths
    • Gravier S., Mollard M. On domination numbers of Cartesian products of paths. Discrete Appl. Math. 80:1997;247-250.
    • (1997) Discrete Appl. Math. , vol.80 , pp. 247-250
    • Gravier, S.1    Mollard, M.2
  • 5
    • 0027607736 scopus 로고
    • Approximating the minimum maximal independence number
    • Halldórsson M.M. Approximating the minimum maximal independence number. Inform. Process. Lett. 46:1993;169-172.
    • (1993) Inform. Process. Lett. , vol.46 , pp. 169-172
    • Halldórsson, M.M.1
  • 7
    • 21144469179 scopus 로고
    • Hamiltonian decompositions of products of cycles
    • Jha P.K. Hamiltonian decompositions of products of cycles. Indian J. Pure Appl. Math. 23:1992;723-729.
    • (1992) Indian J. Pure Appl. Math. , vol.23 , pp. 723-729
    • Jha, P.K.1
  • 8
    • 0029359649 scopus 로고
    • A scheme to construct distance-three codes, with applications to the n-cube
    • Jha P.K., Slutzki G. A scheme to construct distance-three codes, with applications to the. n -cube Inform. Process. Lett. 55:1995;123-127.
    • (1995) Inform. Process. Lett. , vol.55 , pp. 123-127
    • Jha, P.K.1    Slutzki, G.2
  • 9
    • 0039315150 scopus 로고
    • Dominating Cartesian products of cycles
    • Klavžar S., Seifter N. Dominating Cartesian products of cycles. Discrete Appl. Math. 59:1995;129-136.
    • (1995) Discrete Appl. Math. , vol.59 , pp. 129-136
    • Klavžar, S.1    Seifter, N.2
  • 10
    • 0006368112 scopus 로고    scopus 로고
    • On a Vizing-like conjecture for direct-product graphs
    • Klavžar S., Zmazek B. On a Vizing-like conjecture for direct-product graphs. Discrete Math. 156:1996;243-246.
    • (1996) Discrete Math. , vol.156 , pp. 243-246
    • Klavžar, S.1    Zmazek, B.2
  • 13
    • 0347495986 scopus 로고    scopus 로고
    • Associative graph products and their independence, domination and coloring numbers
    • Nowakowski R.J., Rall D.F. Associative graph products and their independence, domination and coloring numbers. Discuss. Math.-Graph Theory. 16:1996;53-79.
    • (1996) Discuss. Math.-Graph Theory , vol.16 , pp. 53-79
    • Nowakowski, R.J.1    Rall, D.F.2


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