The minimum number of colors required for an adjacent vertex-distinguishing total coloring of a simple graph G is called the adjacent vertex-distinguishing total chromatic number, denoted by xat ( G).

  • 若一个正常全染色其相邻顶点的色集不同时,就称之为邻点可区别全染色,邻点可区别全染色所用颜色的最小数称为邻点可区别全色数。

  • 互联网摘选 2025-01-20 17:33:30

    • 相关例句
    精确
    • 模糊
    • 词首
    • 词尾
    • 词义
    • 例句