메뉴 건너뛰기




Volumn 47, Issue 10, 2000, Pages 1531-1534

Optimal L (2, 1) -Labeling of cartesian products of cycles, with an application to independent domination

Author keywords

Cartesian product; Cycle; Frequency assignment; Graph theory; Independent dominating set; L(2, 1) labeling

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL OPERATORS; SET THEORY;

EID: 0034291759     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/81.886984     Document Type: Article
Times cited : (38)

References (12)
  • 1
    • 0019213982 scopus 로고    scopus 로고
    • Frequency assignment: Theory and application
    • vol. 68, pp. 1497-1514, 1980.
    • W. K. Hale, "Frequency assignment: Theory and application," Proc. IEEE, vol. 68, pp. 1497-1514, 1980.
    • Proc. IEEE
    • Hale, W.K.1
  • 2
    • 0013110657 scopus 로고    scopus 로고
    • T-colorings of graphs: Recent results and open problems
    • vol. 93, pp. 229-245, 1991.
    • F. S. Roberts, "T-colorings of graphs: Recent results and open problems," Discrete Math., vol. 93, pp. 229-245, 1991.
    • Discrete Math.
    • Roberts, F.S.1
  • 3
    • 0000801332 scopus 로고    scopus 로고
    • Labeling graphs with a condition at distance two
    • vol. 5, pp. 586-595, 1992.
    • J. R. Griggs and R. K. Yeh, "Labeling graphs with a condition at distance two," SIAM J. Disc. Math., vol. 5, pp. 586-595, 1992.
    • SIAM J. Disc. Math.
    • Griggs, J.R.1    Yeh, R.K.2
  • 4
    • 0038580940 scopus 로고    scopus 로고
    • Relating path coverings to vertex labelings with a condition at distance two
    • vol. 135, pp. 103-111, 1994.
    • J. P. Georges, D. W. Mauro, and M. A. Whittlesey, "Relating path coverings to vertex labelings with a condition at distance two," Discrete Math., vol. 135, pp. 103-111, 1994.
    • Discrete Math.
    • Georges, J.P.1    Mauro, D.W.2    Whittlesey, M.A.3
  • 6
    • 0030367240 scopus 로고    scopus 로고
    • The L(2,1)-labeling on graphs
    • vol. 9, pp. 309-316, 1996.
    • G. J. Chang and D. Kuo, "The L(2,1)-labeling on graphs," SIAM J. Disc. Math., vol. 9, pp. 309-316, 1996.
    • SIAM J. Disc. Math.
    • Chang, G.J.1    Kuo, D.2
  • 7
    • 0041111017 scopus 로고    scopus 로고
    • On distance-two labelings of graphs, Ars
    • vol. 47, pp. 13-22, 1997.
    • D. D.-F. Liu and R. K. Yeh, "On distance-two labelings of graphs," Ars Combin., vol. 47, pp. 13-22, 1997.
    • Combin.
    • Liu, D.D.-F.1    Yeh, R.K.2
  • 8
    • 0021483662 scopus 로고    scopus 로고
    • Clustering and domination in perfect graphs
    • vol. 9, pp. 27-39, 1984.
    • D. G. Corneil and Y. Perl, "Clustering and domination in perfect graphs," Discrete Appl. Math., vol. 9, pp. 27-39, 1984.
    • Discrete Appl. Math.
    • Corneil, D.G.1    Perl, Y.2
  • 9
    • 0039315150 scopus 로고    scopus 로고
    • Dominating Cartesian products of cycles
    • vol. 59, pp. 129-136, 1995.
    • S. Klavžar and N. Seifter, "Dominating Cartesian products of cycles," Discrete Appl. Math., vol. 59, pp. 129-136, 1995.
    • Discrete Appl. Math.
    • Klavžar, S.1    Seifter, N.2
  • 10
    • 33747820984 scopus 로고    scopus 로고
    • Decompositions into cycles I: Hamilton decompositions, in Cycles and Rays, G. Hahn
    • pp. 9-18.
    • B. Alspach, J.-C. Bermond, and D. Sotteau et al., "Decompositions into cycles I: Hamilton decompositions," in Cycles and Rays, G. Hahn et al., Eds. Norwell, MA: Kluwer, 1990, pp. 9-18.
    • Eds. Norwell, MA: Kluwer, 1990
    • Alspach, B.1    Bermond, J.-C.2    Sotteau, D.3
  • 11
    • 0000380901 scopus 로고    scopus 로고
    • Labeling chordal graphs with a condition at distance two
    • vol. 7, pp. 133-140, 1994.
    • D. Sakai, "Labeling chordal graphs with a condition at distance two," SIAM J. Disc. Math., vol. 7, pp. 133-140, 1994.
    • SIAM J. Disc. Math.
    • Sakai, D.1


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