两类图的符号控制数
량류도적부호공제수
Signed domination numbers for two class of graphs
  • 万方数据
    纯粹数学与应用数学 순수수학여응용수학
    PURE AND APPLIED MATHEMATICS
    2014年 3期 271-279 ,共9页

    任媛%赵凌琪%吉日木图%王妍

    임원%조릉기%길일목도%왕연

    图%符号控制函数%符号控制数 圖%符號控製函數%符號控製數
    도%부호공제함수%부호공제수
    graph%signed domination function%signed domination number
    图G 的符号控制数γs(G)有着许多重要的应用背景，因而确定其精确值有重要意义。 Cm 表示m个顶点的圈， n-Cm 和n · Cm 分别表示恰有一条公共边或一个公共顶点的n个Cm 的拷贝。给出了n-Cm 和n · Cm 的符号控制数。
    도G 적부호공제수γs(G)유착허다중요적응용배경，인이학정기정학치유중요의의。 Cm 표시m개정점적권， n-Cm 화n · Cm 분별표시흡유일조공공변혹일개공공정점적n개Cm 적고패。급출료n-Cm 화n · Cm 적부호공제수。
    The signed domination number of a graph has its import and applying background, so it is useful to determinate the exact value of it. Cm denotes the cycle of length m, n-Cm and n · Cm denote the graph obtained from any n copies of Cm which have just one common edge and one common vertex, respectively. In this paper, we obtain the signed domination numbers of n-Cm and n · Cm.
    원문보기 원문다운로드 사이트로이동
저자의 최근 논문